Matroid representation of clique complexes

DOI10.1016/J.DAM.2007.05.004MaRDI QIDQ2381814zbMATH OpenOpenAlexFDO

Authors Kenji Kashiwabara, Yoshio Okamoto, Takeaki Uno

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

zbMATH Keywords

Abstract simplicial complexclique complexflag complexindependence systemmatroid intersectionpartition matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Matroid representation of clique complexes
• The complexity of maximum matroid--greedoid intersection and weighted greedoid maximiza\-tion
• scientific article; zbMATH DE number 4039924
• Fast greedy for linear matroids
• scientific article; zbMATH DE number 1839479

Cites work

• A generalization of line graphs: (X, Y)-intersection graphs
• A New Algorithm for Generating All the Maximal Independent Sets
• A weighted matroid intersection algorithm
• An Analysis of the Greedy Heuristic for Independence Systems
• Characterizing matchings as the intersection of matroids
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Combinatorial optimization. Theory and applications.
• Domination numbers and homology
• Eigenvalues and homology of flag complexes and vector representations of graphs
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 4027489 (Why is no real title available?)
• scientific article; zbMATH DE number 3544074 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1503622 (Why is no real title available?)
• scientific article; zbMATH DE number 1750103 (Why is no real title available?)
• scientific article; zbMATH DE number 863492 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• Matroids and the greedy algorithm
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Note on Independence Functions
• On the numbers of independent k-sets in a claw free graph
• Submodularity of some classes of the combinatorial optimization games
• The clique complex and hypergraph matching
• The Euler characteristic of a nonpositively curved, piecewise Euclidean manifold
• The roots of the independence polynomial of a clawfree graph

Cited in

(10)

• Cliques in dense GF(\(q\))-representable matroids
• The matroid structure of representative triple sets and triple-closure computation
• Matroid representation of clique complexes
• scientific article; zbMATH DE number 4039924 (Why is no real title available?)
• Expansion and contraction functors on matriods
• Transformation and decomposition of clutters into matroids
• Cohen-Macaulayness of monomial ideals and symbolic powers of Stanley-Reisner ideals
• Cohen-Macaulayness of large powers of Stanley-Reisner ideals
• Clonal sets in \(GF(q)\)-representable matroids
• Local topology of the free complex of a two-dimensional generalized convex shelling

This page was built for publication: Matroid representation of clique complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2381814)