A condition for matchability in hypergraphs
From MaRDI portal
Publication:1900519
DOI10.1007/BF01793010zbMath0837.05082MaRDI QIDQ1900519
Publication date: 31 October 1995
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (46)
Sets of Elements that Pairwise Generate a Matrix Ring ⋮ A revival of the girth conjecture ⋮ Matching orderable and separable hypergraphs ⋮ Independence-domination duality in weighted graphs ⋮ Restricted max-min allocation: integrality gap and approximation algorithm ⋮ The circular chromatic index of graphs of high girth ⋮ Almost perfect matchings in random uniform hypergraphs ⋮ A Note on Hitting Maximum and Maximal Cliques With a Stable Set ⋮ Triangle resilience of the square of a Hamilton cycle in random graphs ⋮ The threshold bias of the clique-factor game ⋮ Fair splittings by independent sets in sparse graphs ⋮ On a conjecture of Stein ⋮ Covering cycles in sparse graphs ⋮ Colorings, transversals, and local sparsity ⋮ How many colors guarantee a rainbow matching? ⋮ Deterministic algorithms for the Lovász local lemma: Simpler, more general, and more parallel ⋮ Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings ⋮ The Time Complexity of Constraint Satisfaction ⋮ \(d\)-matching in 3-uniform hypergraphs ⋮ Choice functions ⋮ Sets of elements that pairwise generate a linear group ⋮ Fair Representation by Independent Sets ⋮ Separable and equatable hypergraphs ⋮ Santa Claus Meets Hypergraph Matchings ⋮ Independent systems of representatives in weighted graphs ⋮ Two disjoint independent bases in matroid-graph pairs ⋮ Independence-domination duality ⋮ On finite simple groups and Kneser graphs. ⋮ Semidefinite optimization in discrepancy theory ⋮ Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs ⋮ Unnamed Item ⋮ Acyclic systems of representatives and acyclic colorings of digraphs ⋮ On \((1, \epsilon )\)-restricted max-min fair allocation problem ⋮ Hitting all maximum cliques with a stable set using lopsided independent transversals ⋮ A generalization of Hall's theorem for $k$-uniform $k$-partite hypergraphs ⋮ COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY ⋮ Triangle‐factors in pseudorandom graphs ⋮ An asymptotic bound for the strong chromatic number ⋮ Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes ⋮ Finding independent transversals efficiently ⋮ Matching criticality in intersecting hypergraphs ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Coloring by two-way independent sets ⋮ The intersection of a matroid and a simplicial complex ⋮ A stochastic matching model on hypergraphs ⋮ Cooperative colorings and independent systems of representatives
Cites Work
This page was built for publication: A condition for matchability in hypergraphs
