Multicolored matchings in hypergraphs
From MaRDI portal
Recommendations
Cited in
(24)- Large 2-coloured matchings in 3-coloured complete hypergraphs
- scientific article; zbMATH DE number 5914945 (Why is no real title available?)
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- Rainbow matchings in \(k\)-partite hypergraphs
- Matchings with few colors in colored complete graphs and hypergraphs
- How many colors guarantee a rainbow matching?
- Matchings in colored bipartite networks
- On the rainbow matching conjecture for 3-uniform hypergraphs
- Flattening rank and its combinatorial applications
- A rainbow \(r\)-partite version of the Erdős-Ko-Rado theorem
- Colorful Matchings
- On a generalization of the Ryser-Brualdi-Stein conjecture
- A survey on rainbow matchings in graphs and hypergraphs
- Rainbow matchings in \(r\)-partite \(r\)-graphs
- The maximum number of cliques in hypergraphs without large matchings
- Rainbow matchings in properly-colored hypergraphs
- Extremal Problem for Matchings and Rainbow Matchings on Direct Products
- Quadratic vertex kernel for rainbow matching
- Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv
- Rainbow fractional matchings
- Rainbow perfect matchings in \(r\)-partite graph structures
- Rainbow Turán numbers of matchings and forests of hyperstars in uniform hypergraphs
- Choice functions in the intersection of matroids
- Monochromatic matchings in the shadow graph of almost complete hypergraphs
This page was built for publication: Multicolored matchings in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q446272)
