• Corpus ID: 249461678

New Ramsey Multiplicity Bounds and Search Heuristics

  title={New Ramsey Multiplicity Bounds and Search Heuristics},
  author={Olaf Parczyk and Sebastian Pokutta and Christoph Spiegel and T'i mea Szab'o},
We study two related problems concerning the number of monochromatic cliques in twocolorings of the complete graph that go back to questions of Erdős. Most notably, we improve the 25-year-old upper bounds of Thomason on the Ramsey multiplicity of K4 and K5 and we settle the minimum number of independent sets of size 4 in graphs with clique number at most 4. Motivated by the elusiveness of the symmetric Ramsey multiplicity problem, we also introduce an off-diagonal variant and obtain tight… 
1 Citations

Figures from this paper

Ramsey multiplicity and the Tur\'an coloring
Extending an earlier conjecture of Erd˝os, Burr and Rosta conjectured that among all two-colorings of the edges of a complete graph, the uniformly random coloring asymptotically minimizes the number


On the minimal density of triangles in graphs
The most famous result of extremal combinatorics is probably the celebrated theorem of Turán [20] determining the maximal number ex(n;Kr) of edges in a Kr-free graph on n vertices. Asymptotically,
On tripartite common graphs
A graph $H$ is common if the number of monochromatic copies of $H$ in a 2-edge-colouring of the complete graph $K_n$ is asymptotically minimised by the random
The minimum number of monochromatic 4-term progressions in Z
In this paper we improve the lower bound given by Cameron, Cilleruelo and Serra for the minimum number of monochromatic 4term progressions contained in any 2-coloring of Zp with p a prime. We also
On Erdős's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6
It is shown that the same graph gives rise to two sequences of graphs, one a counteraxmple for t = 5 and the other for t=6 improving the original Thomason’s c5 < 0.906·2 −9 to c5 ≤ 0.885834·2−9.
On the number of complete subgraphs of a graph II
Generalizing some results of P. Erdős and some of L. Moser and J. W. Moon we give lower bounds on the number of complete p-graphs K p of graphs in terms of the numbers of vertices and edges. Further,
What is the minimum number of triangles in a graph of given order and size? Motivated by earlier results of Mantel and Turán, Rademacher solved the first nontrivial case of this problem in 1941. The
Counting monochromatic copies of K_4: a new lower bound for the Ramsey multiplicity problem
Denote by k_4(n) the minimal number of monochromatic copies of a K_4 in a 2-colouring of the edges of K_n and let c_4 := lim k_4(n)/\binom{n}{4}. The best known bounds so far were given by Thomason,
On the densities of cliques and independent sets in graphs
This paper solves the problem in general and proves that in the extremal coloring either the blue edges or the red edges form a clique.
On the Ramsey multiplicities of graphs - problems and recent results
Ramsey's theorem guarantees that any 2-coloring of the edges of a large enough complete graph yields a monochromatic copy of G, and a survey of this and related problems is given, along with a number of new results.
New Lower Bounds for 28 Classical Ramsey Numbers
Several of the new three color bounds for classical two and three color Ramsey numbers are derived from the two color constructions, and the heuristic search procedures used are described.