The clique complex and hypergraph matching
From MaRDI portal
Publication:873650
DOI10.1007/s004930170006zbMath1107.05302OpenAlexW2085366727MaRDI QIDQ873650
Publication date: 29 March 2007
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930170006
Related Items
Vector representation of graph domination ⋮ A revival of the girth conjecture ⋮ Matroid representation of clique complexes ⋮ The circular chromatic index of graphs of high girth ⋮ Mantel's theorem for random graphs ⋮ Amenable category and complexity ⋮ Domination numbers and homology ⋮ On a conjecture of Stein ⋮ Graphs of low average degree without independent transversals ⋮ Sets of elements that pairwise generate a linear group ⋮ A unified view on the functorial nerve theorem and its variations ⋮ Noncover complexes, independence complexes, and domination numbers of hypergraphs ⋮ Degree Conditions for Matchability in 3‐Partite Hypergraphs ⋮ Nerves, minors, and piercing numbers ⋮ Domination numbers and noncover complexes of hypergraphs ⋮ Independent systems of representatives in weighted graphs ⋮ Two disjoint independent bases in matroid-graph pairs ⋮ Minimal non-deletable sets and minimal non-codeletable sets in binary images ⋮ A variation on the homological nerve theorem ⋮ Rainbow simplices in triangulations of manifolds ⋮ Weighted domination of independent sets ⋮ On finite simple groups and Kneser graphs. ⋮ Systems of distant representatives ⋮ A topological colorful Helly theorem ⋮ Different versions of the nerve theorem and colourful simplices ⋮ A geometric Hall-type theorem ⋮ Acyclic systems of representatives and acyclic colorings of digraphs ⋮ A note on interconnecting matchings in graphs ⋮ Multipartite hypergraphs achieving equality in Ryser's conjecture ⋮ Collapsibility of non-cover complexes of graphs ⋮ Topology of random clique complexes ⋮ Vizing's conjecture for chordal graphs ⋮ Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes ⋮ Finding independent transversals efficiently ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Removing degeneracy in LP-type problems revisited ⋮ Coloring by two-way independent sets ⋮ The intersection of a matroid and a simplicial complex ⋮ Cooperative colorings and independent systems of representatives
