Highly connected monochromatic subgraphs of two-colored complete graphs

DOI10.1016/j.jctb.2015.11.006zbMath1329.05172OpenAlexW2208585338MaRDI QIDQ905898

Tomasz Łuczak

Publication date: 28 January 2016

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.2015.11.006

zbMATH Keywords

connectivitycoloringsmonochromatic subgraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (1)

The Erdős-Hajnal conjecture for three colors and triangles

Cites Work

• Note on highly connected monochromatic subgraphs in 2-colored complete graphs
• Highly connected monochromatic subgraphs
• Highly connected multicoloured subgraphs of multicoloured graphs
• Large Monochromatic Components in Edge Colorings of Graphs: A Survey
• Highly connected monochromatic subgraphs of multicolored graphs

This page was built for publication: Highly connected monochromatic subgraphs of two-colored complete graphs