Pages that link to "Item:Q5360466"
From MaRDI portal
The following pages link to The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques (Q5360466):
Displaying 22 items.
- A rainbow Erdős-Rothschild problem (Q322299) (← links)
- The number of Gallai \(k\)-colorings of complete graphs (Q777474) (← links)
- Colourings without monochromatic disjoint pairs (Q1746571) (← links)
- Edge colorings of graphs without monochromatic stars (Q2005736) (← links)
- An extension of the rainbow Erdős-Rothschild problem (Q2032865) (← links)
- Remarks on an edge-coloring problem (Q2132387) (← links)
- Integer colorings with no rainbow \(k\)-term arithmetic progression (Q2143413) (← links)
- Counting Gallai 3-colorings of complete graphs (Q2312802) (← links)
- Colouring set families without monochromatic \(k\)-chains (Q2326327) (← links)
- Edge-colorings of graphs avoiding complete graphs with a prescribed coloring (Q2359958) (← links)
- On graphs with a large number of edge-colorings avoiding a rainbow triangle (Q2403696) (← links)
- On the maximum number of integer colourings with forbidden monochromatic sums (Q2662340) (← links)
- Counting orientations of graphs with no strongly connected tournaments (Q2675820) (← links)
- On graphs with linear Ramsey numbers (Q4521487) (← links)
- Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors (Q4568091) (← links)
- A Rainbow Erdös--Rothschild Problem (Q4596826) (← links)
- Rainbow Erdös--Rothschild Problem for the Fano Plane (Q4959653) (← links)
- Counting <i>H</i>-free orientations of graphs (Q5058452) (← links)
- On Two Problems in Ramsey--Turán Theory (Q5351866) (← links)
- Stability for the Erdős-Rothschild problem (Q5887143) (← links)
- Exact solutions to the Erdős-Rothschild problem (Q6178441) (← links)
- Maximum number of triangle-free edge colourings with five and six colours (Q6621168) (← links)
