Pages that link to "Item:Q2509762"
From MaRDI portal
The following pages link to Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number (Q2509762):
Displaying 15 items.
- A rainbow Erdős-Rothschild problem (Q322299) (← links)
- Edge-colorings avoiding fixed rainbow stars (Q324811) (← links)
- Edge-colorings of uniform hypergraphs avoiding monochromatic matchings (Q472979) (← links)
- Edge-colorings avoiding a fixed matching with a prescribed color pattern (Q1631619) (← 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)
- Integer colorings with no rainbow \(k\)-term arithmetic progression (Q2143413) (← 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)
- Graphs with many edge-colorings such that complete graphs are rainbow (Q2700627) (← links)
- Stability for the Erdős-Rothschild problem (Q5887143) (← links)
- Integer colorings with forbidden rainbow sums (Q6111260) (← links)
