A rainbow Erdös-Rothschild problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5925485 (Why is no real title available?)
- scientific article; zbMATH DE number 3487496 (Why is no real title available?)
- scientific article; zbMATH DE number 3641497 (Why is no real title available?)
- scientific article; zbMATH DE number 878896 (Why is no real title available?)
- scientific article; zbMATH DE number 881297 (Why is no real title available?)
- scientific article; zbMATH DE number 3262986 (Why is no real title available?)
- A Combinatorial Theorem
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
- A rainbow Erdős-Rothschild problem
- A remark on the number of edge colorings of graphs
- A structural result for hypergraphs with many restricted edge colorings
- Edge-colorings avoiding a fixed matching with a prescribed color pattern
- Edge-colorings avoiding fixed rainbow stars
- Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
- Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
- Exact results on the number of restricted edge colorings for some families of linear hypergraphs
- Hypergraph containers
- Independent sets in hypergraphs
- Limits of dense graph sequences
- Multicolour Turán problems
- Multicoloured extremal problems
- On colourings of hypergraphs without monochromatic Fano planes
- On graphs with a large number of edge-colorings avoiding a rainbow triangle
- Rainbow Turán Problems
- Rainbow Turán problem for even cycles
- THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
- The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
- The history of degenerate (bipartite) extremal graph problems
- The maximum number of \(K_{3}\)-free and \(K_{4}\)-free edge 4-colorings
- The number of oriantations having no fixed tournament
Cited in
(21)- Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
- Remarks on an edge-coloring problem
- scientific article; zbMATH DE number 5995288 (Why is no real title available?)
- Colourings without monochromatic disjoint pairs
- An extension of the rainbow Erdős-Rothschild problem
- Integer colorings with no rainbow \(k\)-term arithmetic progression
- Integer colorings with forbidden rainbow sums
- Exact solutions to the Erdős-Rothschild problem
- Rainbow Erdös-Rothschild problem for the Fano plane
- Kruskal-Katona-type problems via the entropy method
- The Typical Structure of Gallai Colorings and Their Extremal Graphs
- Edge-colorings avoiding patterns in a triangle
- Rainbow subgraphs in edge‐colored complete graphs: Answering two questions by Erdős and Tuza
- The number of Gallai k-colorings of complete graphs
- Counting orientations of graphs with no strongly connected tournaments
- Graphs with many edge-colorings such that complete graphs are rainbow
- A rainbow Erdős-Rothschild problem
- Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph
- Edge-colorings avoiding rainbow stars
- Stability for the Erdős-Rothschild problem
- Extremal problems and results related to Gallai-colorings
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 Q4596826)
