The Forbidden Minors of Binary Clutters

DOI10.1112/jlms/s2-12.3.356zbMath0351.05023OpenAlexW2087892819MaRDI QIDQ4120587

P. D. Seymour

Publication date: 1976

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-12.3.356

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of matroids and geometric lattices (05B35) Designs and configurations (05B99)

Related Items (48)

A note on clutter partitions ⋮ Idealness of k-wise Intersecting Families ⋮ Clutters and semimatroids ⋮ Delta Minors, Delta Free Clutters, and Entanglement ⋮ Lehman's Theorem and the Directed Steiner Tree Problem ⋮ Clean Clutters and Dyadic Fractional Packings ⋮ The forbidden projections of unate functions ⋮ A characterization of a class of non-binary matroids ⋮ Intersecting and dense restrictions of clutters in polynomial time ⋮ Characterizations of finitary and cofinitary binary matroids ⋮ Intersecting restrictions in clutters ⋮ Polyhedra of regular p-nary group problems ⋮ Applying Lehman's theorems to packing problems ⋮ Independence and port oracles for matroids, with an application to computational learning theory ⋮ Clean tangled clutters, simplices, and projective geometries ⋮ On the circuit-cocircuit intersection conjecture ⋮ On combinatorial properties of binary spaces ⋮ On Packing Dijoins in Digraphs and Weighted Digraphs ⋮ HYPE: a system of hyperintensional logic (with an application to semantic paradoxes) ⋮ Deltas, extended odd holes and their blockers ⋮ Matroid representation over GF(3) ⋮ A simple approach to some basic results in matroid theory ⋮ Clutters and matroids ⋮ On circulant thin Lehman matrices ⋮ Weak orientability of matroids and polynomial equations ⋮ Clutters and circuits ⋮ Orienting transversals and transition polynomials of multimatroids ⋮ On ideal clutters, metrics and multiflows ⋮ A unified interpretation of several combinatorial dualities ⋮ Combinatorial characterization of read-once formulae ⋮ Monotone clutters ⋮ Ideal clutters ⋮ A new infinite class of ideal minimally non-packing clutters ⋮ The matroids with the max-flow min-cut property ⋮ A note on the production of matroid minors ⋮ Clutters with \(\tau_ 2 \Relbar 2\tau\) ⋮ Opposite Elements in Clutters ⋮ Ideal Clutters That Do Not Pack ⋮ Single Commodity-Flow Algorithms for Lifts of Graphic and CoGraphic Matroids ⋮ On Four Problems in Graph Theory ⋮ On the intersections of circuits and cocircuits in matroids ⋮ Four problems on graphs with excluded minors ⋮ Combinatorial analysis. (Matrix problems, choice theory) ⋮ Intersections of circuits and cocircuits in binary matroids ⋮ On basis-exchange properties for matroids ⋮ A characterization of weakly bipartite graphs ⋮ Functions that are read-once on a subset of their inputs ⋮ Idealness of \(k\)-wise intersecting families

This page was built for publication: The Forbidden Minors of Binary Clutters