Highly connected monochromatic subgraphs of two-colored complete graphs

DOI10.1016/J.JCTB.2015.11.006MaRDI QIDQ905898zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Note on highly connected monochromatic subgraphs in 2-colored complete graphs
• Highly connected monochromatic subgraphs of multicolored graphs
• Highly connected monochromatic subgraphs
• Highly connected multicoloured subgraphs of multicoloured graphs
• On monochromatic subgraphs of edge-colored complete graphs
• Ramsey theory for highly connected monochromatic subgraphs
• Highly connected coloured subgraphs via the regularity Lemma
• Monochromatic connecting colorings in strongly connected oriented graphs
• Total monochromatic connection of graphs
• The monochromatic connectivity of graphs

Cites work

• Highly connected monochromatic subgraphs
• Highly connected monochromatic subgraphs of multicolored graphs
• Highly connected multicoloured subgraphs of multicoloured graphs
• Large monochromatic components in edge colorings of graphs: A survey
• Note on highly connected monochromatic subgraphs in 2-colored complete graphs

Cited in

(25)

• Highly connected multicoloured subgraphs of multicoloured graphs
• Forbidden rainbow subgraphs that force large highly connected monochromatic subgraphs
• Highly Connected Subgraphs with Large Chromatic Number
• Connected colorings of graphs.
• Monochromatic homeomorphically irreducible trees in 2-edge-colored complete graphs
• Large Monochromatic Components in Two-colored Grids
• Common graphs with arbitrary connectivity and chromatic number
• On the profile of multiplicities of complete subgraphs
• Two-colorings with many monochromatic cliques in both colors
• Special monochromatic trees in two-colored complete graphs
• Highly connected monochromatic subgraphs of multicolored graphs
• Highly connected monochromatic subgraphs
• On 2-colored graphs and partitions of boxes
• On Connected Components with Many Edges
• Highly connected coloured subgraphs via the regularity Lemma
• Monochromatic connectivity in monochromatic-star-free graphs
• Estimation of cut-vertices in edge-coloured complete graphs
• A note on 2-edge-colorings of complete graphs with small monochromatic k-connected subgraphs
• The power of many colours
• Colourfully panconnected subgraphs. II.
• Note on highly connected monochromatic subgraphs in 2-colored complete graphs
• Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs
• Forbidden properly edge-colored subgraphs that force large highly connected monochromatic subgraphs
• The Erdős-Hajnal conjecture for three colors and triangles
• Edge-coloured complete graphs: Connectedness of some subgraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905898)