János Komlós

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF	The Asymptotic Normality of $(s,s+1)$-Cores with Distinct Parts	2020	János Komlós Emily Sergel Gábor Tusnády
+	The asymptotic normality of $(s,s+1)$-cores with distinct parts	2018	János Komlós Emily Sergel Gábor Tusnády
+	The asymptotic normality of $(s,s+1)$-cores with distinct parts	2018	János Komlós Emily Sergel Gábor Tusnády
+ PDF Chat	The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition	2017	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi
+ PDF Chat	The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs	2017	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi
+ PDF Chat	The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs	2017	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi
+ PDF Chat	The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result	2017	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi
+ PDF	Testing Goodness of Fit of Random Graph Models	2012	Villő Csiszár Péter Hussami János Komlós Tamás F. Móri Lídia Rejtö Gábor Tusnády
+	Testing goodness-of-fit of random graph models	2012	Villő Csiszár Péter Hussami János Komlós Tamás F. Móri Lídia Rejtö Gábor Tusnády
+	The approximate Loebl-Komlós-Sós Conjecture	2012	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi
+	The approximate Loebl-Komlós-Sós Conjecture	2012	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi
+	Testing goodness-of-fit of random graph models	2012	Villő Csiszár Péter Hussami János Komlós Tamás F. Móri Lídia Rejtö Gábor Tusnády
+	When the degree sequence is a sufficient statistic	2011	Villő Csiszár Péter Hussami János Komlós Tamás F. Móri Lídia Rejtö Gábor Tusnády
+	Limit distribution for the existence of Hamiltonian cycles in a random graph	2006	János Komlós Endre Szemerédi
+	The Regularity Lemma and Its Applications in Graph Theory	2002	János Komlós Ali Shokoufandeh Miklós Simonovits Endre Szemerédi
+ PDF	Spanning Trees in Dense Graphs	2001	János Komlós Gábor N. Sárközy Endre Szemerédi
+ PDF	Proof of the Alon–Yuster conjecture	2001	János Komlós Gábor N. Sárközy Endre Szemerédi
+	The Blow-up Lemma	2001	János Komlós
+	Singularity Probabilities for Random Matrices over Finite Fields	2001	Jeff Kahn János Komlós
+	Tiling Turán Theorems	2000	János Komlós
+	The smallest Ramsey numbers	1999	Rita Csákány János Komlós
+	The Blow-up Lemma	1999	János Komlós
+	Pointwise bounded approximation	1998	János Komlós Gábor Tusnády
+	On the Pósa-Seymour conjecture	1998	János Komlós Gábor N. Sárközy Endre Szemerédi
+	An algorithmic version of the blow-up lemma	1998	János Komlós Gábor N. Sárközy Endre Szemerédi
+ PDF Chat	An algorithmic version of the blow‐up lemma	1998	János Komlós Gábor N. Sárközy Endre Szemerédi
+ PDF	Proof of the Seymour conjecture for large graphs	1998	János Komlós Gábor N. Sárközy Endre Szemerédi
+	Blow-up Lemma	1997	János Komlós Gábor N. Sárközy Endre Szemerédi
+	Topological cliques in graphs II	1996	János Komlós Endre Szemerédi
+	Matching nuts and bolts in O(n log n) time	1996	János Komlós Yuan Ma Endre Szemerédi
+	An Algorithmic Version of the Blow-up Lemma	1996	János Komlós Gábor N. Sárközy Endre Szemerédi
+	Proof of a Packing Conjecture of Bollobás	1995	János Komlós Gábor N. Sárközy Endre Szemerédi
+	Almost all trees have tribe number 2 or 3	1995	János Komlós W. O. J. Moser
+	Szemeredi''s Regularity Lemma and its applications in graph theory	1995	János Komlós Miklós Simonovits
+ PDF	On the probability that a random ±1-matrix is singular	1995	Jeff Kahn János Komlós Endre Szemerédi
+	Topological Cliques in Graphs	1994	János Komlós Endre Szemerédi
+ PDF	Almost tight bounds forɛ-Nets	1992	János Komlós János Pach Gerhard J. Woeginger
+ PDF	On the Properties of a Tree-Structured Server Process	1991	János Komlós Andrew Odlyzko L.H. Ozarow L. A. Shepp
+	Construction of a Thin Set with small Fourier Coefficients	1990	Miklós Ajtai Henryk Iwaniec János Komlós J. Pintz Endre Szemerédi
+	A strange pigeon-hole principle	1990	János Komlós
+	First Occurrence of Hamilton Cycles in Random Graphs	1985	Miklós Ajtai János Komlós Endre Szemerédi
+	On optimal matchings	1984	Miklós Ajtai János Komlós Gábor Tusnády
+	On the distribution of cycle lengths in graphs	1984	András Gyárfás János Komlós Endre Szemerédi
+	On the Size of Separating Systems and Families of Perfect Hash Functions	1984	Michael L. Fredman János Komlós
+	Limit distribution for the existence of hamiltonian cycles in a random graph	1983	János Komlós Endre Szemerédi
+	Every group admits a bad topology	1983	Miklós Ajtai I. Havas János Komlós
+	Extremal uncrowded hypergraphs	1982	Miklós Ajtai János Komlós J. Pintz Joel Spencer Endre Szemerédi
+	Largest random component of ak-cube	1982	Miklós Ajtai János Komlós Endre Szemerédi
+	A Lower Bound for Heilbronn'S Problem	1982	János Komlós J. Pintz Endre Szemerédi
+	On coverings of random graphs	1982	Miklós Ajtai János Komlós Vojtěch Rödl Endre Szemerédi
+	On Heilbronn's Triangle Problem	1981	János Komlós J. Pintz Endre Szemerédi
+ PDF	On Turán’s theorem for sparse graphs	1981	Miklós Ajtai Paul Erdös János Komlós Endre Szemerédi
+	The eigenvalues of random symmetric matrices	1981	Zoltán Füredi János Komlós
+	The longest path in a random graph	1981	Miklós Ajtai János Komlós Endre Szemerédi
+	A Dense Infinite Sidon Sequence	1981	Miklós Ajtai János Komlós Endre Szemerédi
+	A note on Ramsey numbers	1980	Miklós Ajtai János Komlós Endre Szemerédi
+	Topological complete subgraphs in random graphs	1979	Miklós Ajtai János Komlós Endre Szemerédi
+	Linear problems in combinatorial number theory	1975	János Komlós M. Sulyok Endre Szemerédi
+ PDF	Every sequence converging to O weakly in L2 contains an unconditional convergence sequence	1974	János Komlós
+	On the capacity of graphs	1973	Paul Erdös János Komlós
+ PDF	Some Combinatorial Theorems on Monotonicity	1971	Vašek Chvátal János Komlós

Common Coauthors

Coauthor	Papers Together
Endre Szemerédi	35
Miklós Ajtai	12
Gábor N. Sárközy	9
Gábor Tusnády	9
Miklós Simonovits	8
Maya Stein	6
Jan Hladký	6
Tamás F. Móri	4
Péter Hussami	4
Lídia Rejtö	4
Diana Piguet	4
J. Pintz	4
Villő Csiszár	4
Emily Sergel	3
Jeff Kahn	2
Paul Erdös	2
Diana Piguet	2
Endre Szemerédi	1
L. A. Shepp	1
J. Spencer	1
W. O. J. Moser	1
L.H. Ozarow	1
András Gyárfás	1
Zoltán Füredi	1
I. Havas	1
János Pach	1
Andrew Odlyzko	1
Henryk Iwaniec	1
M. Sulyok	1
Ali Shokoufandeh	1
Rita Csákány	1
Michael L. Fredman	1
Gerhard J. Woeginger	1
Yuan Ma	1
Vojtěch Rödl	1
Vašek Chvátal	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	REGULAR PARTITIONS OF GRAPHS	1975	Endre Szemerédi	12
+	Extremal Graph Theory	1978	Béla Bollobás	9
+ PDF	The Algorithmic Aspects of the Regularity Lemma	1994	Noga Alon Richard A. Duke Hanno Lefmann V. Rödl Raphael Yuster	9
+	Proof of a Packing Conjecture of Bollobás	1995	János Komlós Gábor N. Sárközy Endre Szemerédi	7
+	Hamiltonian circuits in random graphs	1976	L. Pósa	6
+	H-Factors in Dense Graphs	1996	Noga Alon Raphael Yuster	5
+	The Ramsey number of a graph with bounded maximum degree	1983	C Chvatál V. Rödl Endre Szemerédi W. T. Trotter	5
+ PDF	AlmostH-factors in dense graphs	1992	Noga Alon Raphael Yuster	5
+	Szemeredi''s Regularity Lemma and its applications in graph theory	1995	János Komlós Miklós Simonovits	5
+ PDF	Proof of the $(n/2-n/2-n/2)$ Conjecture for Large $n$	2011	Yi Zhao	5
+	On the square of a Hamiltonian cycle in dense graphs	1996	J�nos Koml�s G�bor N. S�rk�zy Endre Szemer�di	5
+ PDF Chat	An approximate version of the Loebl–Komlós–Sós conjecture	2011	Diana Piguet Maya Stein	5
+ PDF	On sets of integers containing k elements in arithmetic progression	1975	Endre Szemerédi	5
+	Blow-up Lemma	1997	János Komlós Gábor N. Sárközy Endre Szemerédi	4
+	An algorithmic version of the blow-up lemma	1998	János Komlós Gábor N. Sárközy Endre Szemerédi	4
+ PDF Chat	Embedding large subgraphs into dense graphs	2009	Daniela Kühn Deryk Osthus	4
+	The longest path in a random graph	1981	Miklós Ajtai János Komlós Endre Szemerédi	4
+	The size-Ramsey number of trees	1995	Penny Haxell Yoshiharu Kohayakawa	4
+ PDF Chat	The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result	2017	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi	4
+	Loebl–Komlós–Sós Conjecture: Dense case	2015	Jan Hladký Diana Piguet	4
+	Szemerédi's partition and quasirandomness	1991	Miklós Simonovits Vera T. Sós	4
+ PDF Chat	The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs	2017	Jan Hladký János Komlós Diana Piguet Miklós Simonovits Maya Stein Endre Szemerédi	4
+ PDF	On the structure of linear graphs	1946	Paul Erdös A. H. Stone	3
+ PDF	Proof of the Alon–Yuster conjecture	2001	János Komlós Gábor N. Sárközy Endre Szemerédi	3
+ PDF Chat	Moments of Two-Variable Functions and the Uniqueness of Graph Limits	2010	Christian Borgs Jennifer Chayes László Lovász	3
+ PDF Chat	Embedding Spanning Trees in Random Graphs	2010	Michael Krivelevich	3
+	Szemerédi’s Regularity Lemma for Sparse Graphs	1997	Yoshiharu Kohayakawa	3
+	Constructing Trees in Graphs whose Complement has no <b><i>K</i></b><sub>2,<b><i>s</i></b></sub>	2002	Edward Dobson	3
+ PDF	Universal Graphs for Bounded-Degree Trees and Planar Graphs	1989	Sandeep Bhatt Fan Chung Frank Thomson Leighton Arnold L. Rosenberg	3
+	On Certain Sets of Integers	1953	K. F. Roth	3
+ PDF	The maximum number of edges in a minimal graph of diameter 2	1992	Zoltán Füredi	3
+	A randomized embedding algorithm for trees	2010	Benny Sudakov J. Vondrák	3
+	Proof of the Loebl–Komlós–Sós conjecture for large, dense graphs	2009	Oliver Cooley	3
+ PDF	Large Bounded Degree Trees in Expanding Graphs	2010	József Balogh Béla Csaba Martin Pei Wojciech Samotij	3
+	None	2001	Jochen Harant Margit Voigt Stanislav Jendrol’ Bert Randerath Zdeněk Ryjáček Ingo Schiermeyer	3
+	Tight Bounds for Embedding Bounded Degree Trees	2010	Béla Csaba Judit Nagy-György Ian Levitt Endre Szemerédi	3
+	Ramsey Numbers for Trees of Small Maximum Degree	2002	Penny Haxell Tomasz Łuczak Peter Tingley	3
+ PDF Chat	Embedding nearly-spanning bounded degree trees	2007	Noga Alon Michael Krivelevich Benny Sudakov	3
+ PDF	Can a Graph Have Distinct Regular Partitions?	2009	Noga Alon A. Shapira Uri Stav	3
+	The Square of Paths and Cycles	1995	Genghua Fan H. A. Kierstead	3
+	A note on Hamiltonian circuits	1972	Vašek Chvátal P. Erdős	3
+	Limit distribution for the existence of hamiltonian cycles in a random graph	1983	János Komlós Endre Szemerédi	3
+ PDF	The number of graphs and a random graph with a given degree sequence	2012	Alexander Barvinok J. A. Hartigan	3
+	On universality of graphs with uniformly distributed edges	1986	V. Rödl	3
+	None	2008	Anders Johansson Jeff Kahn Van Vu	3
+ PDF	Extremal Graphs without Large Forbidden Subgraphs	1978	B Bollobás P. Erdős Miklós Simonovits Endre Szemerédi	3
+	A Dense Infinite Sidon Sequence	1981	Miklós Ajtai János Komlós Endre Szemerédi	3
+ PDF	The algorithmic aspects of the regularity lemma	1992	Noga Alon	3
+	Statistical Inference on Random Structures	2008	Villő Csiszár Lídia Rejtö Gábor Tusnády	3
+	2-factors in dense graphs	1996	Noga Alon Eldar Fischer	3