Degree Conditions for Matchability in 3‐Partite Hypergraphs
From MaRDI portal
Publication:4604015
DOI10.1002/jgt.22140zbMath1380.05138arXiv1605.05667OpenAlexW2963734391MaRDI QIDQ4604015
Ron Aharoni, Eli Berger, Ran Ziv, Dani Kotlar
Publication date: 23 February 2018
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.05667
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Transversal (matching) theory (05D15)
Related Items (8)
Topological methods for the existence of a rainbow matching ⋮ Rainbow independent sets in certain classes of graphs ⋮ Large rainbow matchings in general graphs ⋮ All group‐based latin squares possess near transversals ⋮ On rainbow matchings in bipartite graphs ⋮ Covering radius in the Hamming permutation space ⋮ Badges and rainbow matchings ⋮ Cooperative conditions for the existence of rainbow matchings
Cites Work
- On sets not belonging to algebras and rainbow matchings in graphs
- On a lower bound for the connectivity of the independence complex of a graph
- Rainbow matchings and rainbow connectedness
- Rainbow matchings in bipartite multigraphs
- The clique complex and hypergraph matching
- Transversals of latin squares and their generalizations
- An \(n\times n\) Latin square has a transversal with at least \(n-\sqrt n\) distinct symbols
- Transversals in row-latin rectangles
- Domination numbers and homology
- Covering radius for sets of permutations
- Rainbow matchings in \(r\)-partite \(r\)-graphs
- Independent systems of representatives in weighted graphs
- Large matchings in bipartite graphs have a rainbow matching
- On a Generalization of the Ryser-Brualdi-Stein Conjecture
- Hall's theorem for hypergraphs
- Combinatorial Matrix Theory
- A lower bound for the length of a partial transversal in a Latin square
This page was built for publication: Degree Conditions for Matchability in 3‐Partite Hypergraphs
