Pages that link to "Item:Q1684931"
From MaRDI portal
The following pages link to Lower bounds on the number of monochromatic matchings in \(K_{2s+t-1}\) (Q1684931):
Displaying 5 items.
- Coverings by few monochromatic pieces: a transition between two Ramsey problems (Q489351) (← links)
- Exponentially many monochromatic \(n\)-matchings in \(K_{3n-1}\) (Q1926046) (← links)
- Edge colourings of graphs avoiding monochromatic matchings of a given size (Q2883863) (← links)
- On the Profile of Multiplicities of Complete Subgraphs (Q4959760) (← links)
- Monochromatic connected matchings in 2‐edge‐colored multipartite graphs (Q6081557) (← links)