Pages that link to "Item:Q1245970"
From MaRDI portal
The following pages link to The matroids with the max-flow min-cut property (Q1245970):
Displaying 50 items.
- Four problems on graphs with excluded minors (Q1823871) (← links)
- Combinatorial analysis. (Matrix problems, choice theory) (Q1837183) (← links)
- A note on maxflow-mincut and homomorphic equivalence in matroids (Q1840660) (← links)
- Vertex set partitions preserving conservativeness (Q1850496) (← links)
- A characterization of weakly bipartite graphs (Q1850558) (← links)
- A short proof of Guenin's characterization of weakly bipartite graphs (Q1850611) (← links)
- Compositions for matroids with the Fulkerson property (Q1900139) (← links)
- Generalizing the all-pairs min cut problem (Q1910514) (← links)
- Tessellation and \(g\)-tessellation of circulants, \(Q_ 6\), and \(Q_ 6^ t\) (Q1923196) (← links)
- One-third-integrality in the max-cut problem (Q1924057) (← links)
- Independence and port oracles for matroids, with an application to computational learning theory (Q1924488) (← links)
- Cuboids, a class of clutters (Q1985449) (← links)
- Ranking tournaments with no errors. II: Minimax relation (Q1985451) (← links)
- A new infinite class of ideal minimally non-packing clutters (Q2032738) (← links)
- Box-total dual integrality, box-integrality, and equimodular matrices (Q2039243) (← links)
- Testing idealness in the filter oracle model (Q2102851) (← links)
- Idealness of \(k\)-wise intersecting families (Q2118114) (← links)
- Intersecting and dense restrictions of clutters in polynomial time (Q2164697) (← links)
- The max-flow min-cut property and \(\pm 1\)-resistant sets (Q2217497) (← links)
- Max-multiflow/min-multicut for G+H series-parallel (Q2275455) (← links)
- Ranking tournaments with no errors. I: Structural description (Q2284746) (← links)
- On fractional cut covers (Q2312658) (← links)
- Trader multiflow and box-TDI systems in series-parallel graphs (Q2419363) (← links)
- Deltas, extended odd holes and their blockers (Q2421555) (← links)
- The max-flow min-cut property of two-dimensional affine convex geometries (Q2477392) (← links)
- Some insight into characterizations of minimally nonideal matrices (Q2483016) (← links)
- Complexity results on restricted instances of a paint shop problem for words (Q2492209) (← links)
- Solution of two fractional packing problems of Lovász. (Reprint) (Q2497997) (← links)
- Intersecting restrictions in clutters (Q2658378) (← links)
- Clean tangled clutters, simplices, and projective geometries (Q2668014) (← links)
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation (Q2689829) (← links)
- A sharp bound on the size of a connected matroid (Q2723463) (← links)
- Single commodity-flow algorithms for lifts of graphic and cographic matroids (Q2820860) (← links)
- The positive circuits of oriented matroids with the packing property or idealness (Q2883575) (← links)
- An Excluded Minor Characterization of Seymour Graphs (Q3009746) (← links)
- Binary group and Chinese postman polyhedra (Q3717740) (← links)
- Dual row modules and polyhedra of blocking group problems (Q3777799) (← links)
- On ideal clutters, metrics and multiflows (Q4645929) (← links)
- On Four Problems in Graph Theory (Q4722099) (← links)
- Resistant Sets in the Unit Hypercube (Q4991667) (← links)
- Tight Cycle Relaxations for the Cut Polytope (Q5020841) (← links)
- Idealness of k-wise Intersecting Families (Q5041730) (← links)
- Clean Clutters and Dyadic Fractional Packings (Q5071103) (← links)
- A Framework for the Secretary Problem on the Intersection of Matroids (Q5087013) (← links)
- On combinatorial properties of binary spaces (Q5101417) (← links)
- A characterization of Seymour graphs (Q5101429) (← links)
- Opposite Elements in Clutters (Q5219549) (← links)
- Ideal Clutters That Do Not Pack (Q5219553) (← links)
- Perfect, ideal and balanced matrices (Q5943927) (← links)
- On Packing Dijoins in Digraphs and Weighted Digraphs (Q6057808) (← links)
