Two-colorings with many monochromatic cliques in both colors
From MaRDI portal
Publication:463286
DOI10.1016/j.jctb.2013.04.002zbMath1301.05123OpenAlexW2045627469MaRDI QIDQ463286
Mitsuo Kato, Peter Frankl, Norihide Tokushige
Publication date: 16 October 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2013.04.002
Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (2)
Disjoint pairs in set systems with restricted intersection ⋮ On the densities of cliques and independent sets in graphs
Cites Work
- Unnamed Item
- 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
- On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6
- On Sets of Acquaintances and Strangers at any Party
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- A Simple Proof of the Gale-Ryser Theorem
This page was built for publication: Two-colorings with many monochromatic cliques in both colors
