27 citations · 75 across the 6 of their papers we have counts for
6 papers
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…
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…
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…
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…
Testing goodness-of-fit of random graph models
Villö Csiszár, Péter Hussami, János Komlós +3
Random graphs are matrices with independent 0, 1 elements with probabilities determined by a small number of parameters. One of the oldest model is the Rasch model where the odds a…
An Algorithmic Version of the Blow-up Lemma
János Komlós, Gabor N. Sarkozy, Endre Szemerédi
Recently we have developed a new method in graph theory based on the Regularity Lemma. The method is applied to find certain spanning subgraphs in dense graphs. The other main gene…