Monochromatic diameter-2 components in edge colorings of the complete graph
From MaRDI portal
(Redirected from Publication:2233352)
Recommendations
- Large components in \(r\)-edge-colorings of \(K_n\) have diameter at most five
- Large monochromatic components of small diameter
- Finding large \(p\)-colored diameter two subgraphs
- Size of monochromatic double stars in edge colorings
- Exact values of multicolor Ramsey numbers \(R_l(C_{\le l+1})\)
- scientific article; zbMATH DE number 3851127
- Generalizing the Ramsey problem through diameter
- scientific article; zbMATH DE number 4154488
- Covering complete graphs by monochromatically bounded sets
- Forbidden rainbow subgraphs that force large highly connected monochromatic subgraphs
Cites work
- Covering the complete graph by partitions
- Finding large \(p\)-colored diameter two subgraphs
- Generalizing the Ramsey problem through diameter
- Large components in \(r\)-edge-colorings of \(K_n\) have diameter at most five
- Large monochromatic components in edge colorings of graphs: A survey
- Large monochromatic triple stars in edge colourings
Cited in
(9)- Maximum diameter of 3‐ and 4‐colorable graphs
- Generalizing the Ramsey problem through diameter
- Rainbow spanning subgraphs of small diameter in edge-colored complete graphs
- Large components in \(r\)-edge-colorings of \(K_n\) have diameter at most five
- Size of monochromatic double stars in edge colorings
- Low diameter monochromatic covers of complete multipartite graphs
- Covering complete graphs by monochromatically bounded sets
- Large monochromatic components of small diameter
- Bounded \(VC\)-dimension implies the Schur-Erdős conjecture
This page was built for publication: Monochromatic diameter-2 components in edge colorings of the complete graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233352)
