Hall's theorem for hypergraphs
From MaRDI portal
Publication:4518333
DOI<83::AID-JGT2>3.0.CO;2-V 10.1002/1097-0118(200010)35:2<83::AID-JGT2>3.0.CO;2-VzbMath0956.05075OpenAlexW4241906804WikidataQ105609925 ScholiaQ105609925MaRDI QIDQ4518333
Publication date: 4 March 2001
Full work available at URL: https://doi.org/10.1002/1097-0118(200010)35:2<83::aid-jgt2>3.0.co;2-v
Hypergraphs (05C65) Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (62)
Vector representation of graph domination ⋮ A revival of the girth conjecture ⋮ Dirac-type theorems in random hypergraphs ⋮ An extension of Hall's theorem for partitioned bipartite graphs ⋮ The feasible matching problem ⋮ Almost-spanning universality in random graphs (extended abstract) ⋮ 10-tough chordal graphs are Hamiltonian (extended abstract) ⋮ The circular chromatic index of graphs of high girth ⋮ 10-tough chordal graphs are Hamiltonian ⋮ On a Generalization of the Ryser-Brualdi-Stein Conjecture ⋮ Topological methods for the existence of a rainbow matching ⋮ Domination numbers and homology ⋮ On a conjecture of Stein ⋮ How many colors guarantee a rainbow matching? ⋮ Embedding spanning bounded degree subgraphs in randomly perturbed graphs ⋮ Graphs of low average degree without independent transversals ⋮ On Ryser's conjecture for \(t\)-intersecting and degree-bounded hypergraphs ⋮ The clique problem with multiple-choice constraints under a cycle-free dependency graph ⋮ Choice functions ⋮ EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Noncover complexes, independence complexes, and domination numbers of hypergraphs ⋮ Degree Conditions for Matchability in 3‐Partite Hypergraphs ⋮ Fair Representation by Independent Sets ⋮ Santa Claus Meets Hypergraph Matchings ⋮ The size Ramsey number of short subdivisions of bounded degree graphs ⋮ Domination numbers and noncover complexes of hypergraphs ⋮ Independent systems of representatives in weighted graphs ⋮ Total domination edge critical graphs with total domination number three and many dominating pairs ⋮ On rainbow matchings in bipartite graphs ⋮ Rainbow perfect matchings in \(r\)-partite graph structures ⋮ Independence-domination duality ⋮ Rainbow simplices in triangulations of manifolds ⋮ Weighted domination of independent sets ⋮ Almost‐spanning universality in random graphs ⋮ Systems of distant representatives ⋮ A topological colorful Helly theorem ⋮ Unnamed Item ⋮ Independence complexes of chordal graphs ⋮ On linear and semidefinite programming relaxations for hypergraph matching ⋮ A geometric Hall-type theorem ⋮ Extremal hypergraphs for Ryser's conjecture ⋮ Acyclic systems of representatives and acyclic colorings of digraphs ⋮ A note on interconnecting matchings in graphs ⋮ On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs ⋮ Monochromatic components in edge-colored complete uniform hypergraphs ⋮ On Ryser's conjecture for linear intersecting multipartite hypergraphs ⋮ Multipartite hypergraphs achieving equality in Ryser's conjecture ⋮ Collapsibility of non-cover complexes of graphs ⋮ Discrete geometry. Abstracts from the workshop held September 20--26, 2020 (hybrid meeting) ⋮ A Stability Theorem for Matchings in Tripartite 3-Graphs ⋮ Vizing's conjecture for chordal graphs ⋮ Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes ⋮ Finding independent transversals efficiently ⋮ Clique-factors in sparse pseudorandom graphs ⋮ Coloring by two-way independent sets ⋮ The intersection of a matroid and a simplicial complex ⋮ Fractional decompositions of dense hypergraphs ⋮ The hypergraph assignment problem ⋮ Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph ⋮ Cooperative colorings and independent systems of representatives ⋮ Systems of distant representatives in Euclidean space
Cites Work
This page was built for publication: Hall's theorem for hypergraphs
