List of works - János Komlós

A Dense Infinite Sidon Sequence ⬇️

scholarly article from 'European Journal of Combinatorics' published in 1981

A Lower Bound for Heilbronn'S Problem

article by János Komlós et al published February 1982 in Journal of the London Mathematical Society

A note on Ramsey numbers

Almost tight bounds forɛ-Nets

article by János Komlós et al published February 1992 in Discrete and Computational Geometry

An Algorithmic Version of the Blow-up Lemma ⬇️

scholarly article from 'arXiv:math/9612213' published in 1996

Blow-up Lemma

Limit distribution for the existence of hamiltonian cycles in a random graph

On Heilbronn's Triangle Problem

On Turán’s theorem for sparse graphs

scientific article published in December 1981

On the Size of Separating Systems and Families of Perfect Hash Functions

On the capacity of graphs

scientific article published in March 1973

Proof of a Packing Conjecture of Bollobás

scientific article published in 1995

Proof of the Alon–Yuster conjecture

scientific article published in May 2001

Proof of the Seymour conjecture for large graphs

Sorting in c log n parallel steps

scientific article published in 1983

Storing a Sparse Table with 0(1) Worst Case Access Time

article by Michael L. Fredman et al published 26 June 1984 in Journal of the ACM

Storing a sparse table with O(1) worst case access time

Szemerédi’s regularity lemma and its applications in graph theory

scientific article published in 1996

The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition

scientific article published in 2017

The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs

scientific article published in 2017

The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs

scientific article published in 2017

The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result

scientific article published in 2017

List of works by János Komlós

A Dense Infinite Sidon Sequence ⬇️

A Lower Bound for Heilbronn'S Problem

A note on Ramsey numbers

Almost tight bounds forɛ-Nets

An Algorithmic Version of the Blow-up Lemma ⬇️

Blow-up Lemma

Limit distribution for the existence of hamiltonian cycles in a random graph

On Heilbronn's Triangle Problem

On Turán’s theorem for sparse graphs

On the Size of Separating Systems and Families of Perfect Hash Functions

On the capacity of graphs

Proof of a Packing Conjecture of Bollobás

Proof of the Alon–Yuster conjecture

Proof of the Seymour conjecture for large graphs

Sorting in c log n parallel steps

Storing a Sparse Table with 0(1) Worst Case Access Time

Storing a sparse table with O(1) worst case access time

Szemerédi’s regularity lemma and its applications in graph theory

The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition

The Approximate Loebl--Komlós--Sós Conjecture II: The Rough Structure of LKS Graphs

The Approximate Loebl--Komlós--Sós Conjecture III: The Finer Structure of LKS Graphs

The Approximate Loebl--Komlós--Sós Conjecture IV: Embedding Techniques and the Proof of the Main Result

The Regularity Lemma and Its Applications in Graph Theory