Highly connected monochromatic subgraphs

DOI10.1016/J.DISC.2006.01.030MaRDI QIDQ2477397zbMATH OpenOpenAlexFDO

Authors Béla Bollobás, András Gyárfás

Publication date 13 March 2008

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

edge colorings of complete graphsk-connected monochromatic subgraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Highly connected monochromatic subgraphs of two-colored complete graphs
• Note on highly connected monochromatic subgraphs in 2-colored complete graphs
• A note on 2-edge-colorings of complete graphs with small monochromatic k-connected subgraphs
• Highly connected monochromatic subgraphs of multicolored graphs
• Forbidden rainbow subgraphs that force large highly connected monochromatic subgraphs

Cites work

• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 2197938 (Why is no real title available?)
• scientific article; zbMATH DE number 3262254 (Why is no real title available?)
• An upper bound on the Ramsey number of trees
• Covering \(t\)-element sets by partitions
• Edge colorings of complete graphs without tricolored triangles
• Maximum degree and fractional matchings in uniform hypergraphs
• On generalized Ramsey numbers for trees
• Partitioning by monochromatic trees
• Some notes on the Erdős-Szekeres theorem
• Vertex coverings by monochromatic cycles and trees

Cited in

(28)

• Highly connected multicoloured subgraphs of multicoloured graphs
• Forbidden rainbow subgraphs that force large highly connected monochromatic subgraphs
• Heterochromatic tree partition problem in complete tripartite graphs
• scientific article; zbMATH DE number 4041942 (Why is no real title available?)
• Highly Connected Subgraphs with Large Chromatic Number
• Large Monochromatic Components in Two-Colored Grids
• Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs
• Monochromatic homeomorphically irreducible trees in 2-edge-colored complete graphs
• Highly connected subgraphs of graphs with given independence number
• Large Monochromatic Components in Two-colored Grids
• scientific article; zbMATH DE number 3851127 (Why is no real title available?)
• Long monochromatic Berge cycles in colored 4-uniform hypergraphs
• Size of monochromatic double stars in edge colorings
• Heterochromatic tree partition number in complete multipartite graphs
• Highly connected monochromatic subgraphs of multicolored graphs
• scientific article; zbMATH DE number 840704 (Why is no real title available?)
• Highly connected monochromatic subgraphs of two-colored complete graphs
• Highly connected coloured subgraphs via the regularity Lemma
• Monochromatic connectivity in monochromatic-star-free graphs
• A note on 2-edge-colorings of complete graphs with small monochromatic k-connected subgraphs
• The power of many colours
• Size of monochromatic components in local edge colorings
• Monochromatic partitions in local edge colorings
• Colourfully panconnected subgraphs. II.
• Highly connected subgraphs of graphs with given independence number (extended abstract)
• 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

This page was built for publication: Highly connected monochromatic subgraphs

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