Note on highly connected monochromatic subgraphs in 2-colored complete graphs

zbMath1205.05090MaRDI QIDQ625377

Colton Magnant, Shinya Fujita

Publication date: 17 February 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/223488

zbMATH Keywords

highly connected subgraphslarge monochromatic subgraphs

Mathematics Subject Classification ID

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

Related Items (7)

Forbidden properly edge-colored subgraphs that force large highly connected monochromatic subgraphs ⋮ Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs ⋮ Highly connected monochromatic subgraphs of two-colored complete graphs ⋮ Highly connected subgraphs of graphs with given independence number ⋮ Highly connected subgraphs of graphs with given independence number (extended abstract) ⋮ Monochromatic subgraphs in the absence of a properly colored 4-cycle ⋮ A note on 2-edge-colorings of complete graphs with small monochromatic \(k\)-connected subgraphs

This page was built for publication: Note on highly connected monochromatic subgraphs in 2-colored complete graphs