Highly connected monochromatic subgraphs
From MaRDI portal
Publication:2477397
DOI10.1016/j.disc.2006.01.030zbMath1137.05025OpenAlexW2040194719MaRDI QIDQ2477397
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
Related Items (15)
Long monochromatic Berge cycles in colored 4-uniform hypergraphs ⋮ Forbidden properly edge-colored subgraphs that force large highly connected monochromatic subgraphs ⋮ Heterochromatic tree partition problem in complete tripartite graphs ⋮ Size of monochromatic components in local edge colorings ⋮ Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs ⋮ Highly connected monochromatic subgraphs of two-colored complete graphs ⋮ Monochromatic partitions in local edge colorings ⋮ Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs ⋮ Highly connected subgraphs of graphs with given independence number ⋮ Highly connected subgraphs of graphs with given independence number (extended abstract) ⋮ Heterochromatic tree partition number in complete multipartite graphs ⋮ A note on 2-edge-colorings of complete graphs with small monochromatic \(k\)-connected subgraphs ⋮ Size of monochromatic double stars in edge colorings ⋮ Highly connected monochromatic subgraphs of multicolored graphs ⋮ Highly connected coloured subgraphs via the regularity Lemma
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On generalized Ramsey numbers for trees
- Partitioning by monochromatic trees
- Maximum degree and fractional matchings in uniform hypergraphs
- Vertex coverings by monochromatic cycles and trees
- Covering \(t\)-element sets by partitions
- Some notes on the Erdős-Szekeres theorem
- An upper bound on the Ramsey number of trees
- Edge colorings of complete graphs without tricolored triangles
This page was built for publication: Highly connected monochromatic subgraphs
