EUDML

Currently displaying 1 – 5 of 5

Order by Relevance | Title | Year of publication

The Ramsey number of diamond-matchings and loose cycles in hypergraphs.

Gyárfás, András; Sárközy, Gábor N.; Szemerédi, Endre — 2008

The Electronic Journal of Combinatorics [electronic only]

Partitioning 3-colored complete graphs into three monochromatic cycles.

Gyárfás, András; Ruszinkó, Miklós; Sarközy, Gábor N.; Szemerédi, Endre — 2011

The Electronic Journal of Combinatorics [electronic only]

Subset sums modulo a prime

Hoi H. Nguyen; Endre Szemerédi; Van H. Vu — 2008

Acta Arithmetica

On coverings of random graphs

Miklós Ajtai; J. Komlos; Vojtěch Rödl; Endre Szemerédi — 1982

Commentationes Mathematicae Universitatis Carolinae

A note on perfect matchings in uniform hypergraphs with large minimum collective degree

Vojtěch Rödl; Andrzej Ruciński; Mathias Schacht; Endre Szemerédi — 2008

Commentationes Mathematicae Universitatis Carolinae

For an integer $k \geq 2$ and a $k$ -uniform hypergraph $H$ , let $δ_{k - 1} (H)$ be the largest integer $d$ such that every $(k - 1)$ -element set of vertices of $H$ belongs to at least $d$ edges of $H$ . Further, let $t (k, n)$ be the smallest integer $t$ such that every $k$ -uniform hypergraph on $n$ vertices and with $δ_{k - 1} (H) \geq t$ contains a perfect matching. The parameter $t (k, n)$ has been completely determined for all $k$ and large $n$ divisible by $k$ by Rödl, Ruci’nski, and Szemerédi in [, submitted]. The values of $t (k, n)$ are very close to $n / 2 - k$ . In fact, the function $t (k, n) = n / 2 - k + c_{n, k}$ , where $c_{n, k} \in {3 / 2, 2, 5 / 2, 3}$ depends...

Page 1

Download Results (CSV)