Highly connected monochromatic subgraphs of two-colored complete graphs
From MaRDI portal
Publication:905898
DOI10.1016/J.JCTB.2015.11.006zbMATH Open1329.05172OpenAlexW2208585338MaRDI QIDQ905898FDOQ905898
Authors: Tomasz Łuczak 
Publication date: 28 January 2016
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2015.11.006
Recommendations
- Note on highly connected monochromatic subgraphs in 2-colored complete graphs
- Highly connected monochromatic subgraphs of multicolored graphs
- Highly connected monochromatic subgraphs
- Highly connected multicoloured subgraphs of multicoloured graphs
- On monochromatic subgraphs of edge-colored complete graphs
- Ramsey theory for highly connected monochromatic subgraphs
- Highly connected coloured subgraphs via the regularity Lemma
- Monochromatic connecting colorings in strongly connected oriented graphs
- Total monochromatic connection of graphs
- The monochromatic connectivity of graphs
Cites Work
- Highly connected monochromatic subgraphs
- Large monochromatic components in edge colorings of graphs: A survey
- Highly connected monochromatic subgraphs of multicolored graphs
- Note on highly connected monochromatic subgraphs in 2-colored complete graphs
- Highly connected multicoloured subgraphs of multicoloured graphs
Cited In (25)
- Highly connected multicoloured subgraphs of multicoloured graphs
- Forbidden rainbow subgraphs that force large highly connected monochromatic subgraphs
- Highly Connected Subgraphs with Large Chromatic Number
- Connected colorings of graphs.
- Monochromatic homeomorphically irreducible trees in 2-edge-colored complete graphs
- Common graphs with arbitrary connectivity and chromatic number
- Large Monochromatic Components in Two-colored Grids
- On the profile of multiplicities of complete subgraphs
- Special monochromatic trees in two-colored complete graphs
- Two-colorings with many monochromatic cliques in both colors
- Highly connected monochromatic subgraphs of multicolored graphs
- Highly connected monochromatic subgraphs
- On Connected Components with Many Edges
- On 2-colored graphs and partitions of boxes
- Estimation of cut-vertices in edge-coloured 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
- Colourfully panconnected subgraphs. II.
- 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
- The Erdős-Hajnal conjecture for three colors and triangles
- Edge-coloured complete graphs: Connectedness of some subgraphs
This page was built for publication: Highly connected monochromatic subgraphs of two-colored complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905898)
