activity
20102019
most citedThe approximate Loebl-Komlós-Sós Conjecture IV: Embedding techniques and the proof of the main result

27 citations · 90 across the 10 of their papers we have counts for

collaborators

11 papers

math.CO2019

Embedding graphs into larger graphs: results, methods, and problems

Miklós Simonovits, Endre Szemerédi

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…

math.CO2014

On -uniform hypergraphs without linear cycles

András Gyárfás, Ervin Győri, Miklós Simonovits

We explore properties of -uniform hypergraphs without linear cycles. Our main results are that these hypergraphs must contain a vertex of strong degree at most two and must…

math.CO2014★ 16 cited

The approximate Loebl-Komlós-Sós Conjecture II: The rough structure of LKS graphs

Jan Hladký, János Komlós, Diana Piguet +3

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 there exists a number such that…

math.CO2014★ 27 cited

The approximate Loebl-Komlós-Sós Conjecture IV: Embedding techniques and the proof of the main result

Jan Hladký, János Komlós, Diana Piguet +3

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 there exists a number~ such th…

math.CO2014★ 15 cited

The Approximate Loebl-Komlós-Sós Conjecture III: The finer structure of LKS graphs

Jan Hladký, János Komlós, Diana Piguet +3

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 there exists a number such that fo…

math.CO2014★ 16 cited

The approximate Loebl-Komlós-Sós Conjecture I: The sparse decomposition

Jan Hladký, János Komlós, Diana Piguet +3

In a series of four papers we prove the following relaxation of the Loebl-Komlos-Sos Conjecture: For every there exists a number such that for every every -v…

math.CO2014★ 8 cited

The approximate Loebl-Komlos-Sos conjecture and embedding trees in sparse graphs

Jan Hladky, Diana Piguet, Miklos Simonovits +2

Loebl, Komlós and Sós conjectured that every -vertex graph with at least vertices of degree at least contains each tree of order as a subgraph. We give a…

math.CO2013

The history of degenerate (bipartite) extremal graph problems

Zoltán Füredi, Miklós Simonovits

This paper is a survey on Extremal Graph Theory, primarily focusing on the case when one of the excluded graphs is bipartite. On one hand we give an introduction to this field and…

math.CO2013★ 2 cited

Phase transitions in the Ramsey-Turán theory

József Balogh, Ping Hu, Miklós Simonovits

Let be a function and be a graph. Denote by the maximum number of edges of an -free graph on vertices with independence number less than . Er…

math.CO2012★ 6 cited

The approximate Loebl-Komlós-Sós Conjecture

Jan Hladký, János Komlós, Diana Piguet +3

We prove the following version of the Loebl-Komlos-Sos Conjecture: For every alpha>0 there exists a number M such that for every k>M every n-vertex graph G with at least (0.5+alpha…

math.CO2010

On the Multi-coloured Ramsey Numbers of Cycles

Tomasz Łuczak, Miklós Simonovits, Jozef Skokan

For a graph and an integer , denotes the smallest integer for which for any edge-colouring of the complete graph by colours there exists a colou…