A condition for matchability in hypergraphs
From MaRDI portal
Publication:1900519
A complete matching in a hypergraph is a partition of the vertex set into pairwise disjoint edges. An analog of Hall's theorem about complete matchings in certain hypergraphs is proved.
Recommendations
Cites work
Cited in
(70)- Coloring by two-way independent sets
- Almost perfect matchings in random uniform hypergraphs
- Independence-domination duality in weighted graphs
- On a conjecture of Stein
- \(d\)-matching in 3-uniform hypergraphs
- Matchings in n-partite n-graphs
- A revival of the girth conjecture
- Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs
- Matching orderable and separable hypergraphs
- Restricted max-min allocation: integrality gap and approximation algorithm
- Fair splittings by independent sets in sparse graphs
- Cooperative colorings and independent systems of representatives
- Sets of elements that pairwise generate a linear group
- Independent systems of representatives in weighted graphs
- Perfect matchings in balanced hypergraphs
- Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders
- Triangle resilience of the square of a Hamilton cycle in random graphs
- The threshold bias of the clique-factor game
- Separable and equatable hypergraphs
- The existence of bimatching designs
- An Application of the Marriage Lemma
- Eigenvalues of \(K_{1,k}\)-free graphs and the connectivity of their independence complexes
- Sets of Elements that Pairwise Generate a Matrix Ring
- Independent transversals and hypergraph matchings -- an elementary approach
- Matching critical intersection hypergraphs
- Computational complexity of the perfect matching problem in hypergraphs with subcritical density
- An Effective Version of Hall's Theorem
- The intersection of a matroid and a simplicial complex
- The Time Complexity of Constraint Satisfaction
- Santa Claus Meets Hypergraph Matchings
- Acyclic systems of representatives and acyclic colorings of digraphs
- How many colors guarantee a rainbow matching?
- Fair representation by independent sets
- Triangle‐factors in pseudorandom graphs
- Two disjoint independent bases in matroid-graph pairs
- Finding independent transversals efficiently
- A stochastic matching model on hypergraphs
- Restricted max-min allocation: approximation and integrality gap
- no-homomorphism conditions for hypergraphs
- A generalization of Hall's theorem for \(k\)-uniform \(k\)-partite hypergraphs
- Hitting all maximum cliques with a stable set using lopsided independent transversals
- An asymptotic bound for the strong chromatic number
- Matching criticality in intersecting hypergraphs
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Extension of Hall's theorem and an algorithm for finding the (1,n)-complete matching
- A note on hitting maximum and maximal cliques with a stable set
- Covering cycles in sparse graphs
- Colorings, transversals, and local sparsity
- Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel
- Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings
- Choice functions
- Better trees for Santa Claus
- A precise condition for independent transversals in bipartite covers
- Constructing graphs with no independent transversals
- Transference for loose Hamilton cycles in random 3-uniform hypergraphs
- Looms
- Degree conditions for Ramsey goodness of paths
- On a criterion for matchability in hypergraphs
- A geometric programming approach to solve the restricted assignment case of the Santa Claus problem
- A reduction of the ``cycles plus \(K_4\)'s problem
- Approximating minimum sum coloring with bundles
- Improved bounds for zero-sum cycles in \(\mathbb{Z}_p^d\)
- Improved integrality gap in max-min allocation, or, topology at the north pole
- Semidefinite optimization in discrepancy theory
- On \((1, \epsilon )\)-restricted max-min fair allocation problem
- Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
- Efficiently coloring the intersection of a general matroid and combinatorial matroids
- The circular chromatic index of graphs of high girth
- Independence-domination duality
- On finite simple groups and Kneser graphs.
This page was built for publication: A condition for matchability in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900519)
