Pages that link to "Item:Q405108"
From MaRDI portal
The following pages link to How many colors guarantee a rainbow matching? (Q405108):
Displaying 8 items.
- Rainbow perfect matchings in \(r\)-partite graph structures (Q510578) (← links)
- Turán problems for vertex-disjoint cliques in multi-partite hypergraphs (Q785799) (← links)
- Flattening rank and its combinatorial applications (Q2032245) (← links)
- Quadratic vertex kernel for rainbow matching (Q2300725) (← links)
- Choice functions in the intersection of matroids (Q2335696) (← links)
- Rainbow matchings and algebras of sets (Q5890905) (← links)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
- All group‐based latin squares possess near transversals (Q6187426) (← links)
