Problems and Results in Combinatorial Analysis

  title={Problems and Results in Combinatorial Analysis},
  author={Paul L. Erdos}
I gave many lectures by this and similar titles, many in fact in these conferences and I hope in my lecture in 1978 I will give a survey of the old problems and describe what happened to them. In the first part of this paper I discuss some new problems in Ramsey theory and in the second part I discuss some miscellaneous old and new problems. problems and a fairly complete list of my combinatorial problem papers. Denote by f2 r) (n,a) the smallest integer for which it is possible to split the r… 
Problems and Results in Graph Theory and Combinatorial Analysis
I published several papers with similar titles. One of my latest ones [13] (also see [16] and the yearly meetings at Boca Raton or Baton Rouge) contains, in the introduction, many references to my
The basic topics of this survey paper are intersection theorems on graphs and on integers. Before turning to these topics let us mention a few things in connection with combinatorial intersection
Sparse hypergraphs: New bounds and constructions
Random Kneser graphs and hypergraphs
A purely combinatorial approach to the problem based on blow-ups of graphs, which gives much better bounds on the chromatic number of random Kneser and Schrijver graphs and Knesers hypergraphs.
On the chromatic number of general Kneser hypergraphs
Asymptotics of the hypergraph bipartite Tur\'an problem
For positive integers s, t, r, let K (r) s,t denote the r-uniform hypergraph whose vertex set is the union of pairwise disjoint sets X,Y1, . . . , Yt, where |X | = s and |Y1| = · · · = |Yt| = r− 1,
Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
In 1973, Erd˝os conjectured the existence of high girth ( n, 3 , 2)-Steiner systems. Recently, Glock, K¨uhn, Lo, and Osthus and independently Bohman and Warnke proved the approximate version of