A rainbow Erdős-Rothschild problem
From MaRDI portal
Publication:322299
DOI10.1016/J.ENDM.2015.06.066zbMATH Open1346.05072OpenAlexW2177566053MaRDI QIDQ322299FDOQ322299
Authors: Carlos Hoppen, Hanno Lefmann, Knut Odermann
Publication date: 14 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.066
Recommendations
Cites Work
- Title not available (Why is that?)
- Edge-colorings avoiding a fixed matching with a prescribed color pattern
- Multicolour Turán problems
- A remark on the number of edge colorings of graphs
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
- Edge-colorings avoiding fixed rainbow stars
- Rainbow Turán Problems
- Title not available (Why is that?)
- THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
- Title not available (Why is that?)
Cited In (11)
- Counting Gallai 3-colorings of complete graphs
- Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
- Colourings without monochromatic disjoint pairs
- An extension of the rainbow Erdős-Rothschild problem
- Rainbow Erdös-Rothschild problem for the Fano plane
- The Typical Structure of Gallai Colorings and Their Extremal Graphs
- A solution of an Erdős problem
- Stability of extremal hypergraphs with applications to an edge-coloring problem
- Stability for the Erdős-Rothschild problem
- A rainbow Erdös-Rothschild problem
- On graphs with a large number of edge-colorings avoiding a rainbow triangle
This page was built for publication: A rainbow Erdős-Rothschild problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322299)