Items where Author is "Szemerédi, Endre"

Article

Hladký, J. and Komlós, János and Piguet, D. and Simonovits, Miklós and Stein, M. and Szemerédi, Endre (2017) The approximate Loebl-Komlós-Sós conjecture I: The sparse decomposition. SIAM JOURNAL ON DISCRETE MATHEMATICS, 31 (2). pp. 945-982. ISSN 0895-4801

Hladký, J. and Komlós, János and Pigue, D. and Simonovits, Miklós and Stein, M. and Szemerédi, Endre (2017) The approximate Loebl-Komlós-Sós conjecture II: The rough structure of LKS graphs. SIAM JOURNAL ON DISCRETE MATHEMATICS, 31 (2). pp. 983-1016. ISSN 0895-4801

Hladký, J. and Komlós, János and Piguet, D. and Simonovits, Miklós and Stein, M. and Szemerédi, Endre (2017) The approximate Loebl-Komlós-Sós conjecture III: The finer structure of LKS graphs. SIAM JOURNAL ON DISCRETE MATHEMATICS, 31 (2). pp. 1017-1071. ISSN 0895-4801

Hladký, J. and Komlós, János and Piguet, D. and Simonovits, Miklós and Stein, M. and Szemerédi, Endre (2017) The approximate Loebl-Komlós-Sós conjecture IV: Embedding techniques and the proof of the main result. SIAM JOURNAL ON DISCRETE MATHEMATICS, 31 (2). pp. 1072-1148. ISSN 0895-4801

Szemerédi, Endre (2016) Structural Approach to Subset Sum Problems. FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 16 (6). pp. 1737-1749. ISSN 1615-3375

Gyárfás, András and Ruszinkó, Miklós and Sárközy, Gábor and Szemerédi, Endre (2011) Partitioning 3-colored complete graphs into three monochromatic cycles. ELECTRONIC JOURNAL OF COMBINATORICS, 18. pp. 1-16. ISSN 1077-8926

Erdős, Pál and Hajnal, András and Simonovits, Miklós and T. Sós, Vera and Szemerédi, Endre (1994) Turán-Ramsey theorems and Kp-independence numbers. COMBINATORICS PROBABILITY AND COMPUTING, 3 (3). pp. 297-325. ISSN 0963-5483

Erdős, Pál and Hajnal, András and Simonovits, Miklós and T. Sós, Vera and Szemerédi, Endre (1993) Turán-Ramsey theorems and simple asymptotically extremal structures. COMBINATORICA, 13 (1). pp. 31-56. ISSN 0209-9683

Erdős, Pál and Hajnal, András and T. Sós, Vera and Szemerédi, Endre (1983) More Results ON Ramsey Turan Type Problems. COMBINATORICA, 3 (1). pp. 69-81. ISSN 0209-9683

Katona, Gyula and Szemerédi, Endre (1967) On a problem of graph theory. STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 2. pp. 23-28. ISSN 0081-6906

Book Section

Alon, N. and Capalbo, M. and Kohayakawa, Y. and Rödl, V. and Ruciński, A. and Szemerédi, Endre (2015) Near-optimum universal graphs for graphs with bounded degrees (Extended abstract). In: Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques. Lecture Notes in Computer Science (2129). Springer, Berlin; Heidelberg; New York, pp. 170-180. ISBN 978-3-540-42470-3

Monograph

Simonovits, Miklós and Elek, Gábor and Füredi, Zoltán and Győri, Ervin and Patkós, Balázs and Szemerédi, Endre and T. Sós, Vera (2012) Extremális és véletlen struktúrák = Extremal and random structures. Project Report. OTKA.

Győri, Ervin and Elek, Gábor and Erdős, Péter and Katona, Gyula and Sali, Attila and Simonovits, Miklós and Simonyi, Gábor and Szemerédi, Endre and Tardos, Gábor (2010) Hipergráfok = Hypergraphs. Project Report. OTKA.

Katona, Gyula and Ádám, András and Bárány, Imre and Elek, Gábor and Erdős, Péter and Füredi, Zoltán and Gerbner, Dániel and Győri, Ervin and Miklós, Dezső and Pyber, László and Sali, Attila and Simonovits, Miklós and Simonyi, Gábor and Szemerédi, Endre and T. Sós, Vera and Tardos, Gábor (2009) Diszkrét matematika = Discrete mathematics. Project Report. OTKA.

T. Sós, Vera and Biró, András and Elekes, György and Ruzsa, Imre and Szemerédi, Endre (2008) Számelmélet és kombinatorikus vonatkozásai = Number Theory and its Interactions with Combinatorics. Project Report. OTKA.