Pages that link to "Item:Q1785403"
From MaRDI portal
The following pages link to Subgraph polytopes and independence polytopes of count matroids (Q1785403):
Displaying 11 items.
- Extended formulations for sparsity matroids (Q304267) (← links)
- Extended formulations for independence polytopes of regular matroids (Q343749) (← links)
- Smaller extended formulations for the spanning tree polytope of bounded-genus graphs (Q527446) (← links)
- An extended formulation of the convex recoloring problem on a tree (Q1675254) (← links)
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
- Extended formulations for radial cones (Q2294359) (← links)
- Limitations of the hyperplane separation technique for bounding the extension complexity of polytopes (Q2670454) (← links)
- Extended formulations for matroid polytopes through randomized protocols (Q2670489) (← links)
- On Vertices and Facets of Combinatorial 2-Level Polytopes (Q2835675) (← links)
- A note on “A linear‐size zero‐one programming model for the minimum spanning tree problem in planar graphs” (Q4628047) (← links)
- Regular Matroids Have Polynomial Extension Complexity (Q5076712) (← links)
