Szemerédi, E.Overview
Most widely held works by
E Szemerédi
An irregular mind Szemerédi is 70
(
)
4 editions published in 2010 in English and held by 323 WorldCat member libraries worldwide
Theory of algorithms
(
Book
)
6 editions published between 1985 and 1986 in English and Dutch and held by 206 WorldCat member libraries worldwide
An upper bound on the number of planar ksets
by János Pach
(
Book
)
3 editions published in 1990 in English and held by 5 WorldCat member libraries worldwide Abstract: "Given a set S of n points, a subset X of size k is called a kset if there is a hyperplane II that separates X from S  X. We prove that [formula] is an upper bound for the number of ksets in the plane, thus improving the previous bound of Erdös, Lovász, Simmons and Strauss by a factor of [formula]."
Infinite sets of primes with fast primality tests and quick generation of large primes
by J Pintz
(
Book
)
3 editions published in 1988 in English and held by 5 WorldCat member libraries worldwide
Optimal slope selection
by Richard Cole
(
Book
)
1 edition published in 1987 in English and held by 4 WorldCat member libraries worldwide
Many hard examples for resolution
by Vašek Chvátal
(
Book
)
4 editions published in 1987 in English and held by 4 WorldCat member libraries worldwide
On sets of natural numbers whose difference set contains no squares
by J Pintz
(
Book
)
3 editions published in 1987 in English and held by 4 WorldCat member libraries worldwide
On multiplicative representations of integers
by Paul Erdös
(
Book
)
3 editions published in 1975 in English and Undetermined and held by 3 WorldCat member libraries worldwide
On complete subgraphs of rchromatic graphs
by Béla Bollobás
(
Book
)
2 editions published in 1975 in English and held by 3 WorldCat member libraries worldwide
On subgraph number independence in trees
by Ronald L Graham
(
Book
)
3 editions published in 1975 in English and Undetermined and held by 3 WorldCat member libraries worldwide
Two infinite sets of primes with fast primality tests
by János Pintz
(
Book
)
2 editions published in 1987 in German and held by 2 WorldCat member libraries worldwide
On Sparse Graphs with Dense Long Paths
by P Erdoes
(
Book
)
3 editions published in 1975 in English and Undetermined and held by 2 WorldCat member libraries worldwide The following problem was raised by H.J. Stoss in connection with certain questions related to the complexity of Boolean functions. An acyclic directed graph G is said to have property p (m, n) if for any set of X of m vertices of G, there is a directed path of length n in G which does not intersect X. Let f(m, n) denote the minimum number of edges a graph with property p(m, n) can have
Regular partitions of graphs
by E Szemerédi
(
Book
)
1 edition published in 1975 in English and held by 2 WorldCat member libraries worldwide
On the running time of the AdlemanPomeranceRumely primality test
by J Pelikán
(
Book
)
2 editions published in 1991 in English and held by 2 WorldCat member libraries worldwide
Singularity probabilities for random plus or minus 1 matrices
by DIMACS (Group)
(
Book
)
2 editions published in 1991 in English and held by 2 WorldCat member libraries worldwide Abstract: "We report some progress on the old problem of estimating the probability, P[subscript n], that a random n x n [+ and ]1 matrix is singular: Theorem. There is a positive constant [epsilon] for which P[subscript n] <(1  [epsilon])[superscript n]. This is a considerable improvement on the best previous bound, P[subscript n] = 0(1/[square root n]), given by Komlós in 1977, but still falls short of the oftenconjectured [formula]. A Fourieranalytic idea of Halász is a key ingredient of the proof."
On a problem in additive number theory
by András Sárközy
(
Book
)
1 edition published in 1991 in English and held by 2 WorldCat member libraries worldwide
Deterministic simulation in logspace
by Thomas J. Watson IBM Research Center
(
Book
)
1 edition published in 1986 in English and held by 1 WorldCat member library worldwide
On a conjecture of Loebl
by Thomas J. Watson IBM Research Center
(
Book
)
1 edition published in 1994 in English and held by 1 WorldCat member library worldwide
Difference sets without kappath powers
by DIMACS (Group)
(
Book
)
1 edition published in 1991 in English and held by 1 WorldCat member library worldwide
Regular Partitions of Graphs
(
Book
)
1 edition published in 1975 in English and held by 1 WorldCat member library worldwide A crucial lemma in recent work of the author (showing that kterm arithmetic progressionfree sets of integers must have density zero) stated (approximately) that any large bipartite graph can be decomposed into relatively few 'nearly regular' bipartite subgraphs. In this note the author generalizes this result to arbitrary graphs, at the same time strengthening and simplifying the original bipartite result more
fewer
Audience Level
Related Identities
Associated Subjects
Algorithms Combinatorial analysis Combinatorial geometry Combinatorial set theory Computational complexity Computer programming Computer scienceMathematics Functions Graph theory Hungary Machine translating Mathematical analysis Mathematicians MathematicsData processing Matrices Numbers, Natural Numbers, Prime Numbers, PrimeData processing Number theory Partitions (Mathematics) Proof theory Set theory Set theoryData processing Topology Trees (Graph theory)

Alternative Names
Szemerédi, Endre, 1940
Languages
Covers
