A condition for matchability in hypergraphs
From MaRDI portal
Publication:1900519
DOI10.1007/BF01793010zbMATH Open0837.05082MaRDI QIDQ1900519FDOQ1900519
Authors: Penny Haxell 
Publication date: 31 October 1995
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Recommendations
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (61)
- Constructing graphs with no independent transversals
- Covering cycles in sparse graphs
- Transference for loose Hamilton cycles in random 3-uniform hypergraphs
- Looms
- Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings
- Degree conditions for Ramsey goodness of paths
- Better trees for Santa Claus
- A precise condition for independent transversals in bipartite covers
- Independence-domination duality
- Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders
- Title not available (Why is that?)
- On finite simple groups and Kneser graphs.
- On a criterion for matchability in hypergraphs
- Sets of elements that pairwise generate a linear group
- Hitting all maximum cliques with a stable set using lopsided independent transversals
- How many colors guarantee a rainbow matching?
- Independence-domination duality in weighted graphs
- An Effective Version of Hall's Theorem
- Colorings, transversals, and local sparsity
- The circular chromatic index of graphs of high girth
- Santa Claus Meets Hypergraph Matchings
- An Application of the Marriage Lemma
- Eigenvalues of \(K_{1,k}\)-free graphs and the connectivity of their independence complexes
- no-homomorphism conditions for hypergraphs
- Restricted max-min allocation: integrality gap and approximation algorithm
- Matchings in n-partite n-graphs
- On \((1, \epsilon )\)-restricted max-min fair allocation problem
- Fair Representation by Independent Sets
- Matching orderable and separable hypergraphs
- A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs
- Matching critical intersection hypergraphs
- \(d\)-matching in 3-uniform hypergraphs
- Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs
- The intersection of a matroid and a simplicial complex
- Choice functions
- A note on hitting maximum and maximal cliques with a stable set
- Semidefinite optimization in discrepancy theory
- A stochastic matching model on hypergraphs
- Extension of Hall's theorem and an algorithm for finding the \((1,n)\)-complete matching
- A revival of the girth conjecture
- Separable and equatable hypergraphs
- Independent systems of representatives in weighted graphs
- Triangle‐factors in pseudorandom graphs
- An asymptotic bound for the strong chromatic number
- Sets of Elements that Pairwise Generate a Matrix Ring
- The threshold bias of the clique-factor game
- Triangle resilience of the square of a Hamilton cycle in random graphs
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Coloring by two-way independent sets
- Matching criticality in intersecting hypergraphs
- Two disjoint independent bases in matroid-graph pairs
- Cooperative colorings and independent systems of representatives
- On a conjecture of Stein
- Acyclic systems of representatives and acyclic colorings of digraphs
- Almost perfect matchings in random uniform hypergraphs
- Computational complexity of the perfect matching problem in hypergraphs with subcritical density
- Finding independent transversals efficiently
- Fair splittings by independent sets in sparse graphs
- The existence of bimatching designs
- Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel
- The Time Complexity of Constraint Satisfaction
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)
