Search filters

List of works by Endre Szemerédi

A Combinatorial Distinction Between the Euclidean and Projective Planes

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 fast algorithm for equitable coloring

A note on Ramsey numbers

A statistical theorem of set addition

scientific article published in 1994

An 0(n log n) sorting network

An Algorithmic Version of the Blow-up Lemma

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

An Optimal-Time Algorithm for Slope Selection

An approximate Dirac-type theorem for k-uniform hypergraphs

scholarly article from 'Combinatorica' published in 2008

An improved bound for the monochromatic cycle partition number

article by András Gyárfás et al published November 2006 in Journal of Combinatorial Theory, Series B

An upper bound on the number of planarK-sets

article

Arithmetic Progressions, Different Regularity Lemmas and Removal Lemmas

scientific article published in 2015

Blow-up Lemma

Combinatorial properties of systems of sets

scientific article published in May 1978

Deterministic simulation in LOGSPACE

scientific article (publication date: 1987)

Extremal graphs without large forbidden subgraphs

scientific article published in 1978

Extremal problems in discrete geometry

Extremal uncrowded hypergraphs

scholarly article from 'Journal of Combinatorial Theory, Series A' published in 1982

How to avoid using the Regularity Lemma: Pósa’s conjecture revisited

scientific article published in 2010

Integer sets containing no arithmetic progressions

Largest random component of ak-cube

scientific article (publication date: March 1982)

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

Many hard examples for resolution

Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs

scientific article published in 2019

Near-optimum Universal Graphs for Graphs with Bounded Degrees

chapter from 'Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques' published in 2001

On 3-pushdown graphs with large separators

On Heilbronn's Triangle Problem

On Sets of Natural Numbers Whose Difference Set Contains No Squares

scientific article (publication date: April 1988)

On Size Ramsey Numbers of Graphs with Bounded Degree

scholarly article from 'Combinatorica' published in 2000

On Turán’s theorem for sparse graphs

scientific article published in December 1981

On a Ramsey type theorem

scientific article published in March 1972

On a theorem of Behrend

scientific article published in February 1967

On an extremal problem concerning primitive sequences

scientific article published in 1967

On complete subgraphs of r-chromatic graphs

scientific article published in 1975

On determinism versus non-determinism and related problems

article

On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape turing machines

scientific article (publication date: February 1989)

On sets of integers containing no four elements in arithmetic progression

On sets of integers containing no k elements in arithmetic progression

article

On the divisibility properties of integers, I.

scientific article published in 1966

On the solvability of certain equations in sequences of positive upper logarithmic density

Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three*

scientific article published in 2003

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

Some additive and multiplicative problems in number theory

scientific article published in 1975

Sorting in c log n parallel steps

scientific article published in 1983

Sparse partition universal graphs for graphs of bounded degree

scientific article published in 2011

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

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

The Number of Different Distances Determined by a Set of Points in the Euclidean Plane

scientific article published in 1992

The Ramsey number of a graph with bounded maximum degree

scientific article (publication date: June 1983)

The Regularity Lemma and Its Applications in Graph Theory

The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs

scientific article published in 2015

Triple systems with no six points carrying three triangles

Published in "Colloquia Mathematica Societatis Janos Bolyai"

Turán-Ramsey theorems and K_p-independence numbers

scientific article published in September 1994

Turán-Ramsey theorems and simple asymptotically extremal structures

scientific article published in 1993

Undirected connectivity in O(log/sup 1.5/n) space

Universality and tolerance

conference paper from 'Proceedings 41st Annual Symposium on Foundations of Computer Science' published in 2000