The clique complex and hypergraph matching
From MaRDI portal
Recommendations
- On a hypergraph matching problem
- On cliques and Lagrangians of hypergraphs
- Clique complexes and graph powers
- On matchings in hypergraphs
- The complexity of clique graph recognition
- Complexes of graphs with bounded matching size
- scientific article; zbMATH DE number 3634258
- Matching graphs of hypercubes and complete bipartite graphs
- Matching graphs of Hypercubes and Complete Bipartite Graphs
- Clique graphs and Helly graphs
Cited in
(46)- A topological colorful Helly theorem
- A unified view on the functorial nerve theorem and its variations
- Domination numbers and homology
- Amenable category and complexity
- Triangulated spheres and colored cliques
- Matchings in matroids over abelian groups
- Different versions of the nerve theorem and colourful simplices
- Two disjoint independent bases in matroid-graph pairs
- Acyclic systems of representatives and acyclic colorings of digraphs
- Removing degeneracy in LP-type problems revisited
- Noncover complexes, independence complexes, and domination numbers of hypergraphs
- A revival of the girth conjecture
- Coloring by two-way independent sets
- Santa Claus Meets Hypergraph Matchings
- Santa claus meets hypergraph matchings
- Degree conditions for Ramsey goodness of paths
- A geometric Hall-type theorem
- On a conjecture of Stein
- Cooperative colorings and independent systems of representatives
- Large simplicial complexes: universality, randomness, and ampleness
- A note on interconnecting matchings in graphs
- Eigenvalues of \(K_{1,k}\)-free graphs and the connectivity of their independence complexes
- Mantel's theorem for random graphs
- Graphs of low average degree without independent transversals
- Systems of distant representatives
- The circular chromatic index of graphs of high girth
- Topology of random clique complexes
- The intersection of a matroid and a simplicial complex
- Domination numbers and noncover complexes of hypergraphs
- Nerves, minors, and piercing numbers
- On finite simple groups and Kneser graphs.
- Sets of elements that pairwise generate a linear group
- Vector representation of graph domination
- Collapsibility of non-cover complexes of graphs
- Minimal non-deletable sets and minimal non-codeletable sets in binary images
- A variation on the homological nerve theorem
- Finding independent transversals efficiently
- Matroid representation of clique complexes
- Vizing's conjecture for chordal graphs
- Degree conditions for matchability in 3-partite hypergraphs
- Constructing graphs with no independent transversals
- Independent systems of representatives in weighted graphs
- Weighted domination of independent sets
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Multipartite hypergraphs achieving equality in Ryser's conjecture
- Rainbow simplices in triangulations of manifolds
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)
