On a composition of independence systems by circuit identification

DOI10.1016/0095-8956(91)90076-VzbMath0759.05092MaRDI QIDQ1186136

Reinhardt Euler, Ali Ridha Mahjoub

Publication date: 28 June 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

polytopeconvex hullindependent set problemindependence systemsincidence vectors

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Extremal set theory (05D05) Graph theory (05C99)

Related Items

One-node cutsets and the dominating set polytope, Complete linear descriptions of small asymmetric traveling salesman polytopes, A min-max relation for \(K_ 3\)-covers in graphs noncontractible to \(K_ 5\backslash e\), Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth, The anti-join composition and polyhedra, Unnamed Item, Composition of graphs and the triangle-free subgraph polytope

Cites Work

• Unnamed Item
• Bemerkungen zu Hadwigers Vermutung
• \(K_ i\)-covers. I: Complexity and polytopes
• On the cycle polytope of a binary matroid
• Weakly bipartite graphs and the max-cut problem
• Compositions in the bipartite subgraph polytope
• On the acyclic subgraph polytope
• On the Maximum Weight Clique Problem
• A generalization of max flow—min cut
• On the facial structure of set packing polyhedra