Multicolored matchings in hypergraphs

From MaRDI portal

Revision as of 04:11, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:446272

Jump to:navigation, search

zbMath1255.05144MaRDI QIDQ446272

Publication date: 5 September 2012

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

zbMATH Keywords

rainbow matchings additive latin transversals

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15)

Related Items (7)

Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023 ⋮ How many colors guarantee a rainbow matching? ⋮ Rainbow perfect matchings in \(r\)-partite graph structures ⋮ Flattening rank and its combinatorial applications ⋮ Quadratic vertex kernel for rainbow matching ⋮ Choice functions in the intersection of matroids

This page was built for publication: Multicolored matchings in hypergraphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:446272&oldid=12320409"