Pages that link to "Item:Q489351"
From MaRDI portal
The following pages link to Coverings by few monochromatic pieces: a transition between two Ramsey problems (Q489351):
Displaying 8 items.
- Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\) (Q1684931) (← links)
- Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\) (Q1926046) (← links)
- Perfect matchings in shadow colorings (Q2220968) (← links)
- Monochromatic partitions in local edge colorings (Q2220970) (← links)
- Matchings with few colors in colored complete graphs and hypergraphs (Q2305937) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Monochromatic coverings in colored complete graphs (Q3483311) (← links)
- The (t−1) $(t-1)$‐chromatic Ramsey number for paths (Q6094047) (← links)