Pages that link to "Item:Q2359958"
From MaRDI portal
The following pages link to Edge-colorings of graphs avoiding complete graphs with a prescribed coloring (Q2359958):
Displaying 16 items.
- The number of Gallai \(k\)-colorings of complete graphs (Q777474) (← links)
- Pattern avoidance on graphs (Q878624) (← 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)
- Counting Gallai 3-colorings of complete graphs (Q2312802) (← 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)
- A Rainbow Erdös--Rothschild Problem (Q4596826) (← links)
- Rainbow Erdös--Rothschild Problem for the Fano Plane (Q4959653) (← links)
- The Typical Structure of Gallai Colorings and Their Extremal Graphs (Q5204070) (← links)
- The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques (Q5360466) (← links)
- Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph (Q6056777) (← links)
- Integer colorings with forbidden rainbow sums (Q6111260) (← links)
- Edge-colorings avoiding patterns in a triangle (Q6197754) (← links)
