Matroid representation of clique complexes
From MaRDI portal
Publication:2381814
DOI10.1016/j.dam.2007.05.004zbMath1123.05063OpenAlexW1986664537MaRDI QIDQ2381814
Kenji Kashiwabara, Takeaki Uno, Yoshio Okamoto
Publication date: 19 September 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.05.004
independence systemmatroid intersectionclique complexflag complexpartition matroidAbstract simplicial complex
Combinatorial aspects of matroids and geometric lattices (05B35) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Cohen-Macaulayness of monomial ideals and symbolic powers of Stanley-Reisner ideals ⋮ Cohen-Macaulayness of large powers of Stanley-Reisner ideals ⋮ Local topology of the free complex of a two-dimensional generalized convex shelling ⋮ Expansion and contraction functors on matriods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The clique complex and hypergraph matching
- The roots of the independence polynomial of a clawfree graph
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Domination numbers and homology
- Characterizing matchings as the intersection of matroids
- Submodularity of some classes of the combinatorial optimization games
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- On the numbers of independent \(k\)-sets in a claw free graph
- The Euler characteristic of a nonpositively curved, piecewise Euclidean manifold
- Eigenvalues and homology of flag complexes and vector representations of graphs
- Combinatorial optimization. Theory and applications.
- Note on Independence Functions
- A weighted matroid intersection algorithm
- A New Algorithm for Generating All the Maximal Independent Sets
- An Analysis of the Greedy Heuristic for Independence Systems
- A generalization of line graphs: (X, Y)-intersection graphs
- Matroids and the greedy algorithm
