Problems and results in Extremal Combinatorics , Part

Extremal Combinatorics is an area in Discrete Mathematics that has developed spectacularly during the last decades. This paper contains a collection of problems and results in the area, including solutions or partial solutions to open problems suggested by various researchers in Extremal Graph Theory, Extremal Finite Set Theory and Combinatorial Geometry. This is not meant to be a comprehensive survey of the area, it is merely a collection of various extremal problems, which are hopefully interesting. The choice of the problems is inevitably somewhat biased, and as the title of the paper suggests I hope to write a related paper in the future. Each section of this paper is essentially self contained, and can be read separately.

[1]  Karol Borsuk.  Drei Sätze über die n-dimensionale euklidische Sphäre , 1933 .

[2]  H. Eggleston.  Covering a Three‐Dimensional set with Sets of Smaller Diameter , 1955 .

[3]  B. Grünbaum.  A simple proof of Borsuk's conjecture in three dimensions , 1957, Mathematical Proceedings of the Cambridge Philosophical Society.

[4]  H. Wilf.  On the Permanent of a Doubly Stochastic Matrix , 1966, Canadian Journal of Mathematics.

[5]  V. Chvatal,et al.  Some Combinatorial Theorems on Monotonicity , 1971, Canadian Mathematical Bulletin.

[6]  R. Graham,et al.  Increasing paths in edge ordered graphs , 1973 .

[7]  B. Bollobás,et al.  Complete subgraphs of chromatic graphs and hyper-graphs , 1974 .

[8]  Endre Szemerédi,et al.  On complete subgraphs of r-chromatic graphs , 1975, Discret. Math..

[9]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[10]  L. Lovász.  Combinatorial problems and exercises , 1979 .

[11]  W. B. Johnson,et al.  Extensions of Lipschitz mappings into Hilbert space , 1984 .

[12]  A. Robert Calderbank,et al.  Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs , 1984, Discret. Math..

[13]  Noga Alon,et al.  Regular subgraphs of almost regular graphs , 1984, J. Comb. Theory, Ser. B.

[14]  Béla Bollobás,et al.  Random Graphs , 1985 .

[15]  N. Alon.  The linear arboricity of graphs , 1988 .

[16]  Michael Stiebitz,et al.  On constructive methods in the theory of colour-critical graphs , 1989, Discret. Math..

[17]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[18]  Guoping Jin,et al.  Complete Subgraphs of r-partite Graphs , 1992, Combinatorics, probability & computing.

[19]  Noga Alon.  The String Chromatic Number of a Graph , 1992, Random Struct. Algorithms.

[20]  Raphael Yuster,et al.  Independent transversals in r-partite graphs , 1997, Discret. Math..

[21]  Alexander Schrijver,et al.  Counting 1-Factors in Regular Bipartite Graphs , 1998, J. Comb. Theory B.

[22]  The Klee-Grünbaum festival of geometry , 2000 .

[23]  N. Alon,et al.  The Probabilistic Method, Second Edition , 2000 .

[24]  Vladimir Dol'nikov.  Some Properties of Graphs of Diameters , 2000, Discret. Comput. Geom..

[25]  Noga Alon,et al.  Ramsey-type Theorems with Forbidden Subgraphs , 2001, Comb..

[26]  Alexander K. Kelmans,et al.  Asymptotically Optimal Tree-Packings in Regular Graphs , 2001, Electron. J. Comb..

[27]  Robin Thomas,et al.  Large induced forests in sparse graphs , 2001, J. Graph Theory.

[28]  Penny Haxell,et al.  A Note on Vertex List Colouring , 2001, Combinatorics, Probability and Computing.

[29]  Stasys Jukna,et al.  Extremal Combinatorics , 2001, Texts in Theoretical Computer Science. An EATCS Series.

[30]  Raphael Yuster.  Large Monotone Paths in Graphs with Bounded Degree , 2001, Graphs Comb..

[31]  András Gyárfás.  Transitive Edge Coloring of Graphs and Dimension of Lattices , 2002, Comb..

[32]  Martin Goldstern,et al.  Continuous Ramsey Theory on Polish Spaces and Covering the plane by Functions , 2004, J. Math. Log..