The clique complex and hypergraph matching
From MaRDI portal
Publication:873650
DOI10.1007/S004930170006zbMATH Open1107.05302OpenAlexW2085366727MaRDI QIDQ873650FDOQ873650
Publication date: 29 March 2007
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930170006
Cited In (46)
- On finite simple groups and Kneser graphs.
- Vector representation of graph domination
- A topological colorful Helly theorem
- Triangulated spheres and colored cliques
- Sets of elements that pairwise generate a linear group
- A geometric Hall-type theorem
- Constructing graphs with no independent transversals
- Rainbow simplices in triangulations of manifolds
- Matchings in matroids over abelian groups
- Different versions of the nerve theorem and colourful simplices
- Mantel's theorem for random graphs
- A unified view on the functorial nerve theorem and its variations
- Graphs of low average degree without independent transversals
- The circular chromatic index of graphs of high girth
- Santa Claus Meets Hypergraph Matchings
- Eigenvalues of \(K_{1,k}\)-free graphs and the connectivity of their independence complexes
- Domination numbers and homology
- Santa claus meets hypergraph matchings
- The intersection of a matroid and a simplicial complex
- Matroid representation of clique complexes
- A revival of the girth conjecture
- Independent systems of representatives in weighted graphs
- Domination numbers and noncover complexes of hypergraphs
- Amenable category and complexity
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Removing degeneracy in LP-type problems revisited
- Degree Conditions for Matchability in 3‐Partite Hypergraphs
- Large simplicial complexes: universality, randomness, and ampleness
- A note on interconnecting matchings in graphs
- Coloring by two-way independent sets
- Degree conditions for Ramsey goodness of paths
- Vizing's conjecture for chordal graphs
- Two disjoint independent bases in matroid-graph pairs
- Cooperative colorings and independent systems of representatives
- On a conjecture of Stein
- Weighted domination of independent sets
- Acyclic systems of representatives and acyclic colorings of digraphs
- Minimal non-deletable sets and minimal non-codeletable sets in binary images
- Topology of random clique complexes
- Multipartite hypergraphs achieving equality in Ryser's conjecture
- Finding independent transversals efficiently
- Noncover complexes, independence complexes, and domination numbers of hypergraphs
- Systems of distant representatives
- Nerves, minors, and piercing numbers
- Collapsibility of non-cover complexes of graphs
- A variation on the homological nerve theorem
Recommendations
- On a hypergraph matching problem 👍 👎
- Title not available (Why is that?) 👍 👎
- Clique complexes and graph powers 👍 👎
- On matchings in hypergraphs 👍 👎
- The complexity of clique graph recognition 👍 👎
- Complexes of graphs with bounded matching size 👍 👎
- Title not available (Why is that?) 👍 👎
- Matching graphs of hypercubes and complete bipartite graphs 👍 👎
- Matching graphs of Hypercubes and Complete Bipartite Graphs 👍 👎
- Clique graphs and Helly graphs 👍 👎
This page was built for publication: The clique complex and hypergraph matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q873650)
