Zobrazeno 1 - 10
of 161
pro vyhledávání: '"Endre Szemerédi"'
Publikováno v:
Proceedings of the London Mathematical Society. 119:409-439
We show that every 3-uniform hypergraph with $n$ vertices and minimum vertex degree at least $(5/9+o(1))\binom{n}2$ contains a tight Hamiltonian cycle. Known lower bound constructions show that this degree condition is asymptotically optimal.
38
38
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4f6142edd890357e98ba597cf22f4925
https://doi.org/10.1112/plms.12235
https://doi.org/10.1112/plms.12235
Publikováno v:
Springer Proceedings in Mathematics & Statistics ISBN: 9783030679958
We show that if \(A=\{a_1< a_2< \ldots < a_k\}\) is a set of real numbers such that the differences of the consecutive elements are distinct, then for and finite \(B \subset \mathbb {R}\), $$ |A+B|\gg |A|^{1/2}|B|. $$ The bound is tight up to the con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed00aae1292838d0c15f13bf78cd2715
https://doi.org/10.1007/978-3-030-67996-5_24
https://doi.org/10.1007/978-3-030-67996-5_24
Publikováno v:
SIAM Journal on Discrete Mathematics. 31:1072-1148
This is the last paper of a series of four papers in which we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\alpha>0$ there exists a number~$k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at least $(\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c2510050f3586d01720df5e325b3c0bf
https://doi.org/10.1137/140982878
https://doi.org/10.1137/140982878
Publikováno v:
SIAM Journal on Discrete Mathematics. 31:1017-1071
This is the third of a series of four papers in which we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at least $(\frac1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05cb77020e180df7f61e0efcf7e01707
https://doi.org/10.1137/140982866
https://doi.org/10.1137/140982866
Publikováno v:
SIAM Journal on Discrete Mathematics. 31:983-1016
This is the second of a series of four papers in which we prove the following relaxation of the Loebl-Komlos--Sos Conjecture: For every $\alpha>0$ there exists a number $k_0$ such that for every $k>k_0$ every $n$-vertex graph $G$ with at least $(\fra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::724f2494badac46919b0b4f11c3da76c
https://doi.org/10.1137/140982854
https://doi.org/10.1137/140982854
Autor:
Endre Szemerédi, Miklós Simonovits
Publikováno v:
Bolyai Society Mathematical Studies ISBN: 9783662592038
Extremal Graph Theory is a very deep and wide area of modern combinatorics. It is very fast developing, and in this long but relatively short survey we select some of those results which either we feel very important in this field or which are new br
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c6f19b22965aa2e638c8e82b4c3ed471
https://doi.org/10.1007/978-3-662-59204-5_14
https://doi.org/10.1007/978-3-662-59204-5_14
Autor:
Endre Szemerédi
Publikováno v:
Foundations of Computational Mathematics. 16:1737-1749
We discuss results obtained jointly with Van Vu on the length of arithmetic progressions in $$\ell $$l-fold sumsets of the form $$\begin{aligned} \ell \mathcal {A}=\{a_1+\dots +a_\ell ~|~a_i\in \mathcal {A}\} \end{aligned}$$lA={a1+ź+al|aiźA}and $$\
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37a08326e188166120c266743553745d
https://doi.org/10.1007/s10208-016-9326-8
https://doi.org/10.1007/s10208-016-9326-8
Autor:
Péter Hajnal, Endre Szemerédi
Publikováno v:
Bolyai Society Mathematical Studies ISBN: 9783662574126
The semi-random method was introduced in the early eighties. In its first form of the method lower bounds were given for the size of the largest independent set in hypergraphs with certain uncrowdedness properties. The first geometrical application w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::95f0447bc0bb158a9fb7a6986461788f
https://doi.org/10.1007/978-3-662-57413-3_8
https://doi.org/10.1007/978-3-662-57413-3_8
Autor:
Endre Szemerédi
Publikováno v:
Communications in Mathematics and Statistics. 3:315-328
This lecture note is mainly about arithmetic progressions, different regularity lemmas and removal lemmas. We will be very brief most of the time, trying to avoid technical details, even definitions. For most technical details, we refer the reader to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::28ae83057741baa483c972a34ae6776f
https://doi.org/10.1007/s40304-015-0062-1
https://doi.org/10.1007/s40304-015-0062-1