Intersecting and dense restrictions of clutters in polynomial time

DOI10.1007/978-3-031-06901-7_16zbMATH Open1497.90170OpenAlexW4285298983MaRDI QIDQ2164697FDOQ2164697

Martin Drees

Publication date: 16 August 2022

Full work available at URL: https://doi.org/10.1007/978-3-031-06901-7_16

zbMATH Keywords

odd holesdeltascluttersclutter minors

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• Bottleneck extrema
• The matroids with the max-flow min-cut property
• Ideal 0, 1 matrices
• On the width—length inequality
• Title not available (Why is that?)
• The complexity of recognizing linear systems with certain integrality properties
• The Forbidden Minors of Binary Clutters
• Ideal Clutters That Do Not Pack
• Intersecting restrictions in clutters
• Deltas, extended odd holes and their blockers
• Idealness of \(k\)-wise intersecting families

Cited In (2)

• A tight lower bound for the hardness of clutters
• Minimizing clutter using absence in Venn-\(\text i^{\text e}\)

This page was built for publication: Intersecting and dense restrictions of clutters in polynomial time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2164697)