The following pages link to (Q3972125):
Displaying 5 items.
- Chromatic Ramsey number of acyclic hypergraphs (Q729769) (← links)
- Matchings with few colors in colored complete graphs and hypergraphs (Q2305937) (← links)
- The Chromatic Number of Kneser Hypergraphs (Q3743337) (← links)
- Large monochromatic components in 3‐edge‐colored Steiner triple systems (Q6187431) (← links)
- Monochromatic spanning trees and matchings in ordered complete graphs (Q6199379) (← links)
