Highly connected coloured subgraphs via the regularity Lemma

DOI10.1016/j.disc.2009.06.022zbMath1202.05087OpenAlexW2160965961WikidataQ124978147 ScholiaQ124978147MaRDI QIDQ1045023

J. Blot

Publication date: 15 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.06.022

zbMATH Keywords

graph Ramsey numbers\(k\)-connected graphsregularity Lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Connectivity (05C40)

Related Items (1)

Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Highly connected monochromatic subgraphs
• Highly connected multicoloured subgraphs of multicoloured graphs
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Highly connected monochromatic subgraphs of multicolored graphs
• On sets of integers containing k elements in arithmetic progression
• The Algorithmic Aspects of the Regularity Lemma

This page was built for publication: Highly connected coloured subgraphs via the regularity Lemma