Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Regular Partitions of Graphs
- E. Szemerédi
- 1 April 1975
Abstract : A crucial lemma in recent work of the author (showing that k-term arithmetic progression-free sets of integers must have density zero) stated (approximately) that any large bipartite graph…
On sets of integers containing k elements in arithmetic progression
- E. Szemerédi
In 1926 van der Waerden  proved the following startling theorem : If the set of integers is arbitrarily partitioned into two classes then at least one class contains arbitrarily long arithmetic…
Extremal problems in discrete geometry
Several theorems involving configurations of points and lines in the Euclidean plane are established, including one that shows that there is an absolute constantc3 so that whenevern points are placed in the plane not all on the same line, then there is one point on more thanc3n of the lines determined by then points.
Regular pairs behave like complete bipartite graphs from the point of view of bounded degree subgraphs.
A Note on Ramsey Numbers
A Dirac-Type Theorem for 3-Uniform Hypergraphs
- V. Rödl, A. Rucinski, E. Szemerédi
- MathematicsCombinatorics, Probability and Computing
- 1 January 2006
An approximate and asymptotic version of an analogue of Dirac's celebrated theorem for graphs is proved: for each γ>0 there exists n0 such that every 3-uniform hypergraph on n_0 vertices, in which each pair of vertices belongs to at least $(1/2+\gamma)n$ edges, contains a Hamiltonian cycle.
Perfect matchings in large uniform hypergraphs with large minimum collective degree
Storing a sparse table with O(1) worst case access time
- M. Fredman, J. Komlos, E. Szemerédi
- Computer Science23rd Annual Symposium on Foundations of Computer…
- 26 June 1984
A data structure for representing a set of n items from a universe of m items, which uses space n+o(n) and accommodates membership queries in constant time and is easy to implement.
On the probability that a random ±1-matrix is singular
We report some progress on the old problem of estimating the probability, Pn, that a random n× n ± 1 matrix is singular: Theorem. There is a positive constant ε for which Pn < (1− ε)n. This is a…