The Forbidden Minors of Binary Clutters
From MaRDI portal
Publication:4120587
DOI10.1112/JLMS/S2-12.3.356zbMATH Open0351.05023OpenAlexW2087892819MaRDI QIDQ4120587FDOQ4120587
Authors: Paul 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
Permutations, words, matrices (05A05) Combinatorial aspects of matroids and geometric lattices (05B35) Designs and configurations (05B99)
Cited In (50)
- Clutters and circuits
- Monotone clutters
- Functions that are read-once on a subset of their inputs
- On the circuit-cocircuit intersection conjecture
- Clutters and semimatroids
- Clutters and matroids
- Idealness of \(k\)-wise intersecting families
- Lehman's theorem and the directed Steiner tree problem
- A note on the production of matroid minors
- Intersecting restrictions in clutters
- Opposite elements in clutters
- Polyhedra of regular p-nary group problems
- Four problems on graphs with excluded minors
- On basis-exchange properties for matroids
- Clean tangled clutters, simplices, and projective geometries
- A simple approach to some basic results in matroid theory
- The forbidden projections of unate functions
- A characterization of a class of non-binary matroids
- Matroid representation over GF(3)
- On ideal clutters, metrics and multiflows
- On Packing Dijoins in Digraphs and Weighted Digraphs
- On Four Problems in Graph Theory
- Ideal clutters that do not pack
- Ideal clutters
- Delta minors, delta free clutters, and entanglement
- HYPE: a system of hyperintensional logic (with an application to semantic paradoxes)
- Intersecting and dense restrictions of clutters in polynomial time
- Idealness of \(k\)-wise intersecting families
- Independence and port oracles for matroids, with an application to computational learning theory
- The matroids with the max-flow min-cut property
- Clean clutters and dyadic fractional packings
- Deltas, extended odd holes and their blockers
- Clutters with \(\tau_ 2 \Relbar 2\tau\)
- Single commodity-flow algorithms for lifts of graphic and cographic matroids
- On the intersections of circuits and cocircuits in matroids
- A note on clutter partitions
- A characterization of weakly bipartite graphs
- Applying Lehman's theorems to packing problems
- A new infinite class of ideal minimally non-packing clutters
- On circulant thin Lehman matrices
- Intersecting and dense restrictions of clutters in polynomial time
- Intersections of circuits and cocircuits in binary matroids
- Weak orientability of matroids and polynomial equations
- New theoretical results on the monotone Boolean duality and the monotone Boolean dualization problems
- Characterizations of finitary and cofinitary binary matroids
- Combinatorial analysis. (Matrix problems, choice theory)
- On combinatorial properties of binary spaces
- A unified interpretation of several combinatorial dualities
- Combinatorial characterization of read-once formulae
- Orienting transversals and transition polynomials of multimatroids
This page was built for publication: The Forbidden Minors of Binary Clutters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4120587)
