A new infinite class of ideal minimally non-packing clutters

DOI10.1016/j.disc.2021.112413zbMath1466.05024OpenAlexW3158233228MaRDI QIDQ2032738

Matt Superdock, Ahmad Abdi, Cornuéjols, Gérard

Publication date: 14 June 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112413

zbMATH Keywords

cluttersideal minimally non-packing clutters\(\tau = 2\) conjecture\(Q_6\) propertyclean tangled clutters

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (1)

Clean tangled clutters, simplices, and projective geometries

Uses Software

• cuboids-code

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of simple games
• A counterexample to a conjecture of Edmonds and Giles
• The matroids with the max-flow min-cut property
• Ideal 0, 1 matrices
• Cuboids, a class of clutters
• Deltas, extended odd holes and their blockers
• Intersecting restrictions in clutters
• On the width—length inequality
• The Forbidden Minors of Binary Clutters
• A Minimax Theorem for Directed Graphs
• Idealness of k-wise Intersecting Families
• Ideal Clutters That Do Not Pack
• Bottleneck extrema
• Blocking and anti-blocking pairs of polyhedra
• The packing property.
• On dijoins

This page was built for publication: A new infinite class of ideal minimally non-packing clutters