Cuboids, a class of clutters

DOI10.1016/J.JCTB.2019.10.002MaRDI QIDQ1985449zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Cubillages in odd dimensions
• Lattice of cubes
• scientific article; zbMATH DE number 3949320
• Cubicoids: modeling and visualization
• Cubes and orientability
• Cube
• Cube

Cites work

• 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?)
• A Solution of the Shannon Switching Game
• 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
• 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
• 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.
• (0, 1) ideal matrices

Cited in

(15)

• Resistant sets in the unit hypercube
• Testing idealness in the filter oracle model
• The max-flow min-cut property and \(\pm 1\)-resistant sets
• Idealness and 2-resistant sets
• Idealness of \(k\)-wise intersecting families
• Intersecting restrictions in clutters
• Clean tangled clutters, simplices, and projective geometries
• On Packing Dijoins in Digraphs and Weighted Digraphs
• Correction to: ``Idealness of \(k\)-wise intersecting families
• Delta minors, delta free clutters, and entanglement
• Total dual dyadicness and dyadic generating sets
• cuboids-code
• Idealness of \(k\)-wise intersecting families
• Clean clutters and dyadic fractional packings
• A new infinite class of ideal minimally non-packing clutters

Describes a project that uses

Uses Software

• GitHub
• Racket

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)