Pages that link to "Item:Q2305937"
From MaRDI portal
The following pages link to Matchings with few colors in colored complete graphs and hypergraphs (Q2305937):
Displaying 8 items.
- Coverings by few monochromatic pieces: a transition between two Ramsey problems (Q489351) (← links)
- Monochromatic matchings in the shadow graph of almost complete hypergraphs (Q659584) (← links)
- Matchings in colored bipartite networks (Q1613406) (← links)
- Large 2-coloured matchings in 3-coloured complete hypergraphs (Q1953324) (← links)
- The (t−1) $(t-1)$‐chromatic Ramsey number for paths (Q6094047) (← links)
- Colorful Matchings (Q6098465) (← links)
- An improvement on Łuczak's connected matchings method (Q6133269) (← links)
- The power of many colours (Q6652256) (← links)