Large monochromatic components in 3-colored non-complete graphs
From MaRDI portal
(Redirected from Publication:778694)
Recommendations
- Monochromatic components in edge-coloured graphs with large minimum degree
- Large monochromatic components in edge colored graphs with a minimum degree condition
- Large monochromatic components in colorings of complete 3-uniform hypergraphs
- Large monochromatic components in multicolored bipartite graphs
- Large monochromatic components in almost complete graphs and bipartite graphs
Cites work
- Generalizing the Ramsey problem through diameter
- Highly connected monochromatic subgraphs of multicolored graphs
- Large monochromatic components in edge colored graphs with a minimum degree condition
- Large monochromatic components in multicolored bipartite graphs
- Monochromatic cycles in 2-coloured graphs
- On Schelp's problem for three odd long cycles
- Star versus two stripes Ramsey numbers and a conjecture of Schelp
Cited in
(9)- Large monochromatic components in edge colorings of graphs: A survey
- Large monochromatic components in 3‐edge‐colored Steiner triple systems
- Large monochromatic components in edge colored graphs with a minimum degree condition
- Large monochromatic components in hypergraphs with large minimum codegree
- Large Monochromatic Components in Two-Colored Grids
- Large monochromatic components in almost complete graphs and bipartite graphs
- Monochromatic components in edge-coloured graphs with large minimum degree
- Large monochromatic components in colorings of complete 3-uniform hypergraphs
- Large monochromatic components in expansive hypergraphs
This page was built for publication: Large monochromatic components in 3-colored non-complete graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778694)