Pages that link to "Item:Q4568091"
From MaRDI portal
The following pages link to Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors (Q4568091):
Displaying 8 items.
- 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)
- Colouring set families without monochromatic \(k\)-chains (Q2326327) (← links)
- Graphs with many edge-colorings such that complete graphs are rainbow (Q2700627) (← links)
- Rainbow Erdös--Rothschild Problem for the Fano Plane (Q4959653) (← links)
- Stability for the Erdős-Rothschild problem (Q5887143) (← links)
- Edge-colorings avoiding patterns in a triangle (Q6197754) (← links)
