• Publications
• Influence
On random graphs, I
• 2,180
• 264
• PDF
A combinatorial problem in geometry
• Mathematics
• 2009
Our present problem has been suggested by Miss Esther Klein in connection with the following proposition.
• 900
• 193
• PDF
INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Mathematics
• 1961
2. Notation The letters a, b, c, d, x, y, z denote finite sets of non-negative integers, all other lower-case letters denote non-negative integers. If fc I, then [k, I) denotes the setExpand
• 1,163
• 167
• PDF
Some remarks on the theory of graphs
The present note consists of some remarks on graphs. A graph G is a set of points some of which are connected by edges. We assume here that no two points are connected by more than one edge. TheExpand
• 556
• 101
• PDF
On Sets of Distances of n Points
1. The function f(n). Let [P. ] be the class of all planar subsets P. of n points and denote by f(n) the minimum number of different distances determined by its n points for P,, an element of { P. }.Expand
• 499
• 85
• PDF
On a lemma of Littlewood and Offord
Remark. Choose Xi = l, n even. Then the interval ( — 1, + 1 ) contains Cn,m s u m s ^ i e ^ , which shows that our theorem is best possible. We clearly can assume that all the Xi are not less than 1.Expand
• 415
• 82
• PDF
Graph Theory and Probability
A well-known theorem of Ramsay (8; 9) states that to every n there exists a smallest integer g(n) so that every graph of g(n) vertices contains either a set of n independent points or a completeExpand
• 588
• 71
On extremal problems of graphs and generalized graphs
AbstractAnr-graph is a graph whose basic elements are its vertices and r-tuples. It is proved that to everyl andr there is anε(l, r) so that forn>n0 everyr-graph ofn vertices andnr−ε(l, r) r-tuplesExpand
• 334
• 65
• PDF
Ramsey-type theorems
• Computer Science, Mathematics
• Discret. Appl. Math.
• 1 September 1989
In this paper we will consider Ramsey-type problems for finite graphs, r -partitions and hypergraphs. Expand
• 206
• 59
• PDF