Two-colorings with many monochromatic cliques in both colors
From MaRDI portal
(Redirected from Publication:463286)
Recommendations
Cites work
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- A Simple Proof of the Gale-Ryser Theorem
- 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
Cited in
(8)- Disjoint pairs in set systems with restricted intersection
- Edge-coloring cliques with many colors on subcliques
- On 2-colored graphs and partitions of boxes
- Improved bound on the maximum number of clique-free colorings with two and three colors
- scientific article; zbMATH DE number 2140323 (Why is no real title available?)
- Red-blue clique partitions and \((1-1)\)-transversals
- On the profile of multiplicities of complete subgraphs
- On the densities of cliques and independent sets in graphs
This page was built for publication: Two-colorings with many monochromatic cliques in both colors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463286)