A Stability Theorem for Matchings in Tripartite 3-Graphs

DOI10.1017/S0963548318000147zbMath1402.05158arXiv1701.06451OpenAlexW2963337680MaRDI QIDQ4962591

Penny E. Haxell, Lothar Narins

Publication date: 5 November 2018

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.06451

Mathematics Subject Classification ID

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

Cites Work

• On a lower bound for the connectivity of the independence complex of a graph
• Construction of universal bundles. II
• Ryser's conjecture for tripartite 3-graphs
• Domination numbers and homology
• Independent systems of representatives in weighted graphs
• The intersection of a matroid and a simplicial complex
• Hall's theorem for hypergraphs
• On the degree, size, and chromatic index of a uniform hypergraph

This page was built for publication: A Stability Theorem for Matchings in Tripartite 3-Graphs