Intersecting and dense restrictions of clutters in polynomial time
From MaRDI portal
Publication:2164697
DOI10.1007/978-3-031-06901-7_16zbMath1497.90170OpenAlexW4285298983MaRDI QIDQ2164697
Publication date: 16 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06901-7_16
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of recognizing linear systems with certain integrality properties
- The matroids with the max-flow min-cut property
- Ideal 0, 1 matrices
- Idealness of \(k\)-wise intersecting families
- Deltas, extended odd holes and their blockers
- Intersecting restrictions in clutters
- On the width—length inequality
- The Forbidden Minors of Binary Clutters
- Ideal Clutters That Do Not Pack
- Bottleneck extrema
This page was built for publication: Intersecting and dense restrictions of clutters in polynomial time