On the existence of a rainbow 1‐factor in 1‐factorizations of K

DOI10.1002/JCD.20136zbMATH Open1138.05056OpenAlexW2000493090WikidataQ114236284 ScholiaQ114236284MaRDI QIDQ5434633FDOQ5434633

Authors: S. I. El-Zanati, Michael J. Plantholt, Papa A. Sissokho, Lawrence E. Spence 

Publication date: 7 January 2008

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.20136

Recommendations

• scientific article; zbMATH DE number 1229733
• Rainbow \(H\)-factors of complete \(s\)-uniform \(r\)-partite hypergraphs
• Rainbow factors in hypergraphs
• Rainbow \(H\)-factors
• Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations

zbMATH Keywords

rainbow matchingorthogonal 1-factorrainbow 1-factor

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (5)

• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• A Disproof of the Fon-der-Flaass Conjecture
• Rainbow and orthogonal paths in factorizations of \(K_n\)
• Rainbow \(H\)-factors of complete \(s\)-uniform \(r\)-partite hypergraphs
• Rainbow factors in hypergraphs

This page was built for publication: On the existence of a rainbow 1‐factor in 1‐factorizations of K

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434633)