The following pages link to On the width-length inequality (Q4180280):
Displaying 15 items.
- A new infinite family of minimally nonideal matrices (Q618293) (← links)
- Vertex adjacencies in the set covering polyhedron (Q730484) (← links)
- Matroids and multicommodity flows (Q1161527) (← links)
- Colouring non-even digraphs (Q2094875) (← links)
- Testing idealness in the filter oracle model (Q2102851) (← links)
- Idealness of \(k\)-wise intersecting families (Q2118114) (← links)
- On ideal semicomplete digraphs (Q2296276) (← links)
- Clean tangled clutters, simplices, and projective geometries (Q2668014) (← links)
- Polyhedral Combinatorics in Combinatorial Optimization (Q3763906) (← links)
- Enumerating Minimal Transversals of Hypergraphs without Small Holes (Q5005157) (← links)
- Idealness of k-wise Intersecting Families (Q5041730) (← links)
- On Dyadic Fractional Packings of $T$-Joins (Q5043644) (← links)
- Clean Clutters and Dyadic Fractional Packings (Q5071103) (← links)
- Energy of convex sets, shortest paths, and resistance (Q5937247) (← links)
- On Packing Dijoins in Digraphs and Weighted Digraphs (Q6057808) (← links)
