Cuboids, a class of clutters

DOI10.1016/j.jctb.2019.10.002zbMath1436.05023OpenAlexW2981903969MaRDI QIDQ1985449

Natália Guričanová, Ahmad Abdi, Dabeen Lee, Cornuéjols, Gérard

Publication date: 7 April 2020

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

Full work available at URL: http://eprints.lse.ac.uk/102395/1/cuboids.pdf

zbMATH Keywords

packing propertycluttersideal clutters\(\tau =2\) conjecture\(f\)-flowing conjecturecuboidsgeneralized set covering inequalitiesideal minimally non-packing cluttersreplication conjecturesums of circuits property

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (14)

Idealness of k-wise Intersecting Families ⋮ Delta Minors, Delta Free Clutters, and Entanglement ⋮ Clean Clutters and Dyadic Fractional Packings ⋮ Intersecting restrictions in clutters ⋮ Clean tangled clutters, simplices, and projective geometries ⋮ On Packing Dijoins in Digraphs and Weighted Digraphs ⋮ The max-flow min-cut property and \(\pm 1\)-resistant sets ⋮ A new infinite class of ideal minimally non-packing clutters ⋮ Idealness and 2-resistant sets ⋮ cuboids-code ⋮ Resistant Sets in the Unit Hypercube ⋮ Testing idealness in the filter oracle model ⋮ Idealness of \(k\)-wise intersecting families ⋮ Correction to: ``Idealness of \(k\)-wise intersecting families

Uses Software

• Racket
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of simple games
• On the cycle polytope of a binary matroid
• Decomposition of regular matroids
• A counterexample to a conjecture of Edmonds and Giles
• Matroids and multicommodity flows
• The matroids with the max-flow min-cut property
• Ideal 0, 1 matrices
• \((0,\pm 1)\) ideal matrices
• Cropped cubes
• A short proof of Seymour's characterization of the matroids with the max-flow min-cut property
• Combinatorial Optimization
• Perfect and Ideal 0, ±1 Matrices
• Integer Programming
• On 2-partitionable clutters and the MFMC property
• Greedy algorithm and symmetric matroids
• On the width—length inequality
• A generalization of max flow—min cut
• Matching, Euler tours and the Chinese postman
• On combinatorial properties of binary spaces
• Ideal Clutters That Do Not Pack
• A Solution of the Shannon Switching Game
• Bottleneck extrema
• Polyhedral decompositions of cubic graphs
• Blocking and anti-blocking pairs of polyhedra
• The packing property.

This page was built for publication: Cuboids, a class of clutters