On the Ramsey multiplicity of complete graphs

DOI10.1007/s00493-012-2465-xzbMath1299.05245arXiv0711.4999OpenAlexW2019438351MaRDI QIDQ452823

David Conlon

Publication date: 17 September 2012

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0711.4999

zbMATH Keywords

complete graphedge two-coloringmonochromatic complete graph

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (15)

On a conjecture of Erdős for multiplicities of cliques ⋮ Linear configurations containing 4-term arithmetic progressions are uncommon ⋮ The number of additive triples in subsets of abelian groups ⋮ Edges not in any monochromatic copy of a fixed graph ⋮ Monochromatic triangles in three-coloured graphs ⋮ String graphs and incomparability graphs ⋮ On the number of monotone sequences ⋮ A note on the inducibility of 4-vertex graphs ⋮ Extremal problems and results related to Gallai-colorings ⋮ Induced Turán Numbers ⋮ Variants of the Erdős-Szekeres and Erdős-Hajnal Ramsey problems ⋮ On the Profile of Multiplicities of Complete Subgraphs ⋮ Short proofs of some extremal results III ⋮ An improved lower bound for multicolor Ramsey numbers and a problem of Erdős ⋮ Threshold Ramsey multiplicity for paths and even cycles

Cites Work

• Unnamed Item
• 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
• Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
• On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6
• Multiplicities of subgraphs
• On Sets of Acquaintances and Strangers at any Party
• A Disproof of a Conjecture of Erdős in Ramsey Theory

This page was built for publication: On the Ramsey multiplicity of complete graphs