Cuboids, a class of clutters
From MaRDI portal
Publication:1985449
Recommendations
Cites work
- (0, 1) ideal matrices
- A class of simple games
- A counterexample to a conjecture of Edmonds and Giles
- A generalization of max flow—min cut
- A short proof of Seymour's characterization of the matroids with the max-flow min-cut property
- A Solution of the Shannon Switching Game
- Blocking and anti-blocking pairs of polyhedra
- Bottleneck extrema
- Combinatorial optimization. Packing and covering
- Cropped cubes
- Decomposition of regular matroids
- Greedy algorithm and symmetric matroids
- scientific article; zbMATH DE number 3728302 (Why is no real title available?)
- scientific article; zbMATH DE number 16723 (Why is no real title available?)
- scientific article; zbMATH DE number 16724 (Why is no real title available?)
- scientific article; zbMATH DE number 3477226 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- Ideal 0, 1 matrices
- Ideal clutters that do not pack
- Integer Programming
- Matching, Euler tours and the Chinese postman
- Matroids and multicommodity flows
- On 2-partitionable clutters and the MFMC property
- On combinatorial properties of binary spaces
- On the cycle polytope of a binary matroid
- On the width—length inequality
- Perfect and ideal \(0, \pm 1\) matrices
- Polyhedral decompositions of cubic graphs
- The matroids with the max-flow min-cut property
- The packing property.
Cited in
(17)- A new infinite class of ideal minimally non-packing clutters
- Testing idealness in the filter oracle model
- Idealness of \(k\)-wise intersecting families
- Correction to: ``Idealness of \(k\)-wise intersecting families
- The max-flow min-cut property and \(\pm 1\)-resistant sets
- Idealness and 2-resistant sets
- Intersecting restrictions in clutters
- Clean tangled clutters, simplices, and projective geometries
- Delta minors, delta free clutters, and entanglement
- cuboids-code
- Resistant sets in the unit hypercube
- Idealness of k-wise intersecting families
- Clean clutters and dyadic fractional packings
- On Packing Dijoins in Digraphs and Weighted Digraphs
- Total dual dyadicness and dyadic generating sets
- From coordinate subspaces over finite fields to ideal multipartite uniform clutters
- Lower bounds for cube-ideal set-systems
This page was built for publication: Cuboids, a class of clutters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1985449)