Short Proofs of Some Extremal Results

We prove several results from different areas of extremal combinatorics, giving complete or partial solutions to a number of open problems. These results, coming from areas such as extremal graph theory, Ramsey theory and additive combinatorics, have been collected together because in each case the relevant proofs are quite short.

[1]  V. Sós,et al.  Combinatorics, Paul Erdős is eighty , 1993 .

[2]  Mohammad R. Salavatipour.  Large Induced Forests in Triangle-Free Planar Graphs , 2006, Graphs Comb..

[3]  Vojtech Rödl,et al.  Extremal Problems for Sets Forming Boolean Algebras and Complete Partite Hypergraphs , 1999, J. Comb. Theory, Ser. A.

[4]  Michael Krivelevich,et al.  Ks-Free Graphs Without Large Kr-Free Subgraphs , 1994, Combinatorics, Probability and Computing.

[5]  Paul Erdös,et al.  Quantitative Forms of a Theorem of Hilbert , 1985, J. Comb. Theory, Ser. A.

[6]  Noga Alon,et al.  Constructive Bounds for a Ramsey-Type Problem , 1997, Graphs Comb..

[7]  Benny Sudakov.  A conjecture of Erdős on graph Ramsey numbers , 2011 .

[8]  David Conlon,et al.  The Ramsey number of dense graphs , 2009, 0907.2657.

[9]  P. Erdös,et al.  Combinatorial Theorems on Classifications of Subsets of a Given Set , 1952 .

[10]  Andrzej Rucinski,et al.  Two variants of the size Ramsey number , 2005, Discuss. Math. Graph Theory.

[11]  Richard M. Wilson,et al.  Constructions and Uses of Pairwise Balanced Designs , 1975 .

[12]  Guy Wolfovitz,et al.  K4-free graphs without large induced triangle-free subgraphs , 2013, Comb..

[13]  Benny Sudakov,et al.  Large Kr‐free subgraphs in Ks‐free graphs and some other Ramsey‐type problems , 2005, Random Struct. Algorithms.

[14]  D. Conlon,et al.  Hypergraph Ramsey numbers , 2008, 0808.3760.

[15]  Hal A. Kierstead,et al.  On-line Ramsey Theory , 2004, Electron. J. Comb..

[16]  Andrzej Dudek,et al.  On generalized Ramsey numbers of Erdős and Rogers , 2014, J. Comb. Theory, Ser. B.

[17]  Jacques Verstraëte,et al.  Clique partitions of complements of forests and bounded degree graphs , 2008, Discret. Math..

[18]  On representation problems in the additive number theory , 1996 .

[19]  Richard H. Schelp,et al.  Ramsey unsaturated and saturated graphs , 2006, J. Graph Theory.

[20]  Benny Sudakov.  Large K r -free subgraphs in K s -free graphs and some other Ramsey-type problems , 2005 .

[21]  Yoshiharu Kohayakawa,et al.  Ramsey Games Against a One-Armed Bandit , 2003, Comb. Probab. Comput..

[22]  Benny Sudakov,et al.  Density theorems for bipartite graphs and related Ramsey-type results , 2007, Comb..

[23]  Benny Sudakov,et al.  A New Lower Bound For A Ramsey-Type Problem , 2005, Comb..

[24]  Terence Tao,et al.  A sharp inverse Littlewood‐Offord theorem , 2009, Random Struct. Algorithms.

[25]  Jane Butterfield,et al.  On-line Ramsey Theory for Bounded Degree Graphs , 2011, Electron. J. Comb..

[26]  Maya Jakobine Stein,et al.  Cycles Are Strongly Ramsey-Unsaturated , 2012, Combinatorics, Probability and Computing.

[27]  Frank Plumpton Ramsey,et al.  On a Problem of Formal Logic , 1930 .

[28]  Noga Alon,et al.  Problems and results in extremal combinatorics--I , 2003, Discret. Math..

[29]  D. Hilbert,et al.  Über die Irreduzibilität ganzer rationaler Funktionen mit ganzzahligen Koeffizienten , 1933 .

[30]  Yanxun Chang,et al.  A bound for Wilson's theorem (III) , 1996 .

[31]  E. Szemeri~di,et al.  On Sets of Integers Containing No Four Elements in Arithmetic Progression , .

[32]  Andrzej Dudek,et al.  On Generalized Ramsey Numbers for 3‐Uniform Hypergraphs , 2013, J. Graph Theory.

[33]  Angelika Steger,et al.  Upper Bounds for Online Ramsey Games in Random Graphs , 2009, Comb. Probab. Comput..

[34]  Angelika Steger,et al.  Online Ramsey Games in Random Graphs , 2009, Comb. Probab. Comput..

[35]  N. Hegyvári.  On the Dimension of the Hilbert Cubes , 1999 .

[36]  David Conlon,et al.  On-line Ramsey Numbers , 2009, SIAM J. Discret. Math..

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

[38]  T. Tao,et al.  Inverse Littlewood-Offord theorems and the condition number of random discrete matrices , 2005, math/0511215.

[39]  Riste Skrekovski,et al.  An improved bound on the largest induced forests for triangle-free planar graphs , 2010, Discret. Math. Theor. Comput. Sci..

[40]  Hal A. Kierstead,et al.  Coloring number and on-line Ramsey theory for graphs and hypergraphs , 2009, Comb..

[41]  Van Vu,et al.  Optimal Inverse Littlewood-Offord theorems , 2010, 1004.3967.

[42]  James B. Shearer,et al.  On the Independence Number of Sparse Graphs , 1995, Random Struct. Algorithms.

[43]  David Conlon.  Hypergraph Packing and Sparse Bipartite Ramsey Numbers , 2009, Comb. Probab. Comput..

[44]  Noga Alon,et al.  Problems and results in extremal combinatorics - II , 2008, Discret. Math..

[45]  D. Hilbert.  Ueber die Irreducibilität ganzer rationaler Functionen mit ganzzahligen Coefficienten. , 1892 .

[46]  Andrzej Dudek,et al.  On Ks-free subgraphs in Ks+k-free graphs and vertex Folkman numbers , 2011, Comb..

[47]  J. Orlin.  Contentment in graph theory: Covering graphs with cliques , 1977 .

[48]  Paul Erdös,et al.  The Construction of Certain Graphs , 1966, Canadian Journal of Mathematics.

[49]  David A. Gregory,et al.  Clique partitions of the cocktail party graph , 1986, Discret. Math..

[50]  Jin Akiyama,et al.  Maximum induced forests of planar graphs , 1987, Graphs Comb..

[51]  Michael Krivelevich,et al.  Bounding Ramsey Numbers through Large Deviation Inequalities , 1995, Random Struct. Algorithms.