Hall's theorem for hypergraphs
From MaRDI portal
Publication:4518333
Recommendations
- Hall's and Kőnig's theorem in graphs and hypergraphs
- A Harary-Sachs theorem for hypergraphs
- Erdős-Hajnal-type theorems in hypergraphs
- On a possible extension of Hall's theorem to bipartite hypergraphs
- On extending Hansel's theorem to hypergraphs
- Hypergraph extensions of the Erdős-Gallai theorem
- Hypergraph extensions of the Erdős-Gallai theorem
- Mathematical Foundations of Computer Science 2005
- A generalization of a graph result of D. W. Hall
- A hypergraph version of the Gallai-Edmonds Theorem
Cites work
Cited in
(82)- Vizing's conjecture for chordal graphs
- Coloring by two-way independent sets
- Compatible systems of representatives
- Domination numbers and homology
- On a conjecture of Stein
- Embedding spanning bounded degree subgraphs in randomly perturbed graphs
- On Ryser's conjecture for t-intersecting and degree-bounded hypergraphs
- Systems of distant representatives
- Halin's theorem for cubic graphs on an annulus
- Triangulated spheres and colored cliques
- A revival of the girth conjecture
- Rainbow simplices in triangulations of manifolds
- Weighted domination of independent sets
- On the König-Hall-Egerváry theorem for multidimensional matrices and multipartite hypergraphs
- Discrete geometry. Abstracts from the workshop held September 20--26, 2020 (hybrid meeting)
- Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph
- Dirac-type theorems in random hypergraphs
- The clique problem with multiple-choice constraints under a cycle-free dependency graph
- Noncover complexes, independence complexes, and domination numbers of hypergraphs
- Domination numbers and noncover complexes of hypergraphs
- Collapsibility of non-cover complexes of graphs
- Clique-factors in sparse pseudorandom graphs
- The hypergraph assignment problem
- Cooperative colorings and independent systems of representatives
- Systems of distant representatives in Euclidean space
- The feasible matching problem
- Topological methods for the existence of a rainbow matching
- Independent systems of representatives in weighted graphs
- Hall ratio of the Mycielski graphs
- A note on interconnecting matchings in graphs
- Monochromatic components in edge-colored complete uniform hypergraphs
- An extension of Hall's theorem for partitioned bipartite graphs
- A geometric Hall-type theorem
- Eigenvalues of \(K_{1,k}\)-free graphs and the connectivity of their independence complexes
- Monochromatic components in edge-colored complete uniform hypergraphs
- Vector representation of graph domination
- On a generalization of the Ryser-Brualdi-Stein conjecture
- Independent transversals and hypergraph matchings -- an elementary approach
- Almost-spanning universality in random graphs (extended abstract)
- 10-tough chordal graphs are Hamiltonian (extended abstract)
- The intersection of a matroid and a simplicial complex
- Fractional decompositions of dense hypergraphs
- 10-tough chordal graphs are Hamiltonian
- Santa Claus Meets Hypergraph Matchings
- Acyclic systems of representatives and acyclic colorings of digraphs
- How many colors guarantee a rainbow matching?
- scientific article; zbMATH DE number 1151851 (Why is no real title available?)
- Degree conditions for matchability in 3-partite hypergraphs
- Fair representation by independent sets
- The size Ramsey number of short subdivisions of bounded degree graphs
- A stability theorem for matchings in tripartite 3-graphs
- Total domination edge critical graphs with total domination number three and many dominating pairs
- Finding independent transversals efficiently
- On rainbow matchings in bipartite graphs
- Rainbow perfect matchings in \(r\)-partite graph structures
- EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
- Almost-spanning universality in random graphs
- Multipartite hypergraphs achieving equality in Ryser's conjecture
- Graphs of low average degree without independent transversals
- Choice functions
- Towards the Erdős-Gallai cycle decomposition conjecture
- Towards the Erdős-Gallai cycle decomposition conjecture
- Matchings in matroids over abelian groups
- Separating path systems of almost linear size
- Constructing graphs with no independent transversals
- On the chromatic number of powers of subdivisions of graphs
- Nearly Hamilton cycles in sublinear expanders and applications
- Bounded degree graphs and hypergraphs with no full rainbow matchings
- Hall's marriage theorem
- The connectivity of Vietoris-Rips complexes of spheres
- Improved integrality gap in max-min allocation, or, topology at the north pole
- Edge-disjoint cycles with the same vertex set
- Matchings in multipartite hypergraphs
- A topological colorful Helly theorem
- On linear and semidefinite programming relaxations for hypergraph matching
- Extremal hypergraphs for Ryser's conjecture
- On Ryser's conjecture for linear intersecting multipartite hypergraphs
- Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
- A Hall-type theorem for triplet set systems based on medians in trees
- The circular chromatic index of graphs of high girth
- Independence-domination duality
- Independence complexes of chordal graphs
This page was built for publication: Hall's theorem for hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4518333)
