Two-colorings with many monochromatic cliques in both colors

DOI10.1016/J.JCTB.2013.04.002zbMATH Open1301.05123OpenAlexW2045627469MaRDI QIDQ463286FDOQ463286

Mitsuo Kato, Peter Frankl, Gyula O. H. Katona, 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

Recommendations

• scientific article; zbMATH DE number 4023316
• On the densities of cliques and independent sets in graphs
• On 2-colored graphs and partitions of boxes
• Edge disjoint monochromatic triangles in 2-colored graphs
• Highly connected monochromatic subgraphs of two-colored complete graphs

zbMATH Keywords

Ramsey theoryYoung diagramedge coloringunimodal sequence

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Cites Work

• Title not available (Why is that?)
• On Sets of Acquaintances and Strangers at any Party
• On Erdős's conjecture on multiplicities of complete subgraphs: Lower upper bound for cliques of size 6
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• 2-colorings of complete graphs with a small number of monochromatic \(K_ 4\) subgraphs
• A Simple Proof of the Gale-Ryser Theorem

Cited In (4)

• Title not available (Why is that?)
• Disjoint pairs in set systems with restricted intersection
• On the densities of cliques and independent sets in graphs
• Edge-coloring cliques with many colors on subcliques

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)