A rainbow Erdős-Rothschild problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 3487496 (Why is no real title available?)
- scientific article; zbMATH DE number 881297 (Why is no real title available?)
- A remark on the number of edge colorings of graphs
- Edge-colorings avoiding a fixed matching with a prescribed color pattern
- Edge-colorings avoiding fixed rainbow stars
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
- Multicolour Turán problems
- Rainbow Turán Problems
- THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
Cited in
(12)- A solution of an Erdős problem
- Counting Gallai 3-colorings of complete graphs
- Stability for the Erdős-Rothschild problem
- Stability of extremal hypergraphs with applications to an edge-coloring problem
- The Typical Structure of Gallai Colorings and Their Extremal Graphs
- Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
- A rainbow Erdös-Rothschild problem
- Exact solutions to the Erdős-Rothschild problem
- On graphs with a large number of edge-colorings avoiding a rainbow triangle
- Rainbow Erdös-Rothschild problem for the Fano plane
- Colourings without monochromatic disjoint pairs
- An extension of the rainbow Erdős-Rothschild problem
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)