The following pages link to On 3-colorings of \(E(K_ n)\) (Q685557):
Displaying 5 items.
- Voloshin's colourings of \(P_{3}\)-designs (Q1420592) (← links)
- Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\) (Q1926046) (← links)
- A new proof of 3-colorability of Eulerian triangulations (Q3119059) (← links)
- Coloring with three‐colored subgraphs (Q4800398) (← links)
- The number of edge colorings with no monochromatic triangle (Q4879181) (← links)