Highly connected monochromatic subgraphs
From MaRDI portal
Publication:2477397
DOI10.1016/J.DISC.2006.01.030zbMATH Open1137.05025OpenAlexW2040194719MaRDI QIDQ2477397FDOQ2477397
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
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
- Title not available (Why is that?)
- An upper bound on the Ramsey number of trees
- Title not available (Why is that?)
- Partitioning by monochromatic trees
- Vertex coverings by monochromatic cycles and trees
- Edge colorings of complete graphs without tricolored triangles
- Maximum degree and fractional matchings in uniform hypergraphs
- On generalized Ramsey numbers for trees
- Title not available (Why is that?)
- Some notes on the Erdős-Szekeres theorem
- Covering \(t\)-element sets by partitions
Cited In (28)
- Highly connected multicoloured subgraphs of multicoloured graphs
- Forbidden rainbow subgraphs that force large highly connected monochromatic subgraphs
- Highly Connected Subgraphs with Large Chromatic Number
- Heterochromatic tree partition problem in complete tripartite graphs
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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)
- Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs
- Note on highly connected monochromatic subgraphs in 2-colored complete graphs
- 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)
