Highly connected multicoloured subgraphs of multicoloured graphs

DOI10.1016/J.DISC.2007.09.031MaRDI QIDQ2519826zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 27 January 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0702369

zbMATH Keywords

\(k\)-connected graphsgraph Ramsey numbers

Mathematics Subject Classification ID

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

Abstract: Suppose the edges of the complete graph on n vertices are coloured using r colours; how large a k-connected subgraph are we guaranteed to find, which uses only at most s of the colours? This question is due to Bollobas, and the case s = 1 was considered in a preivous paper by the same authors. Here we consider the case s >= 2, and mention some open problems.

Recommendations

• Highly connected monochromatic subgraphs of multicolored graphs
• Highly connected coloured subgraphs via the regularity Lemma
• Highly connected monochromatic subgraphs of two-colored complete graphs
• Highly connected monochromatic subgraphs
• Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs

Cites work

• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Highly connected multicoloured subgraphs of multicoloured graphs
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• Maximum degree and fractional matchings in uniform hypergraphs

Cited in

(12)

• Size of monochromatic double stars in edge colorings
• Highly connected coloured subgraphs via the regularity Lemma
• Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs
• Size of monochromatic components in local edge colorings
• A note on 2-edge-colorings of complete graphs with small monochromatic k-connected subgraphs
• Highly connected multicoloured subgraphs of multicoloured graphs
• Connected tropical subgraphs in vertex-colored graphs
• scientific article; zbMATH DE number 3851127 (Why is no real title available?)
• Highly connected monochromatic subgraphs of multicolored graphs
• scientific article; zbMATH DE number 1146221 (Why is no real title available?)
• The power of many colours
• Highly connected monochromatic subgraphs of two-colored complete graphs

This page was built for publication: Highly connected multicoloured subgraphs of multicoloured graphs

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