The Forbidden Minors of Binary Clutters
From MaRDI portal
Publication:4120587
DOI10.1112/jlms/s2-12.3.356zbMath0351.05023MaRDI QIDQ4120587
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
05A05: Permutations, words, matrices
05B35: Combinatorial aspects of matroids and geometric lattices
05B99: Designs and configurations
Related Items
Clutters and circuits, Combinatorial characterization of read-once formulae, Monotone clutters, Clutters and matroids, Intersections of circuits and cocircuits in binary matroids, Functions that are read-once on a subset of their inputs, A note on clutter partitions, The forbidden projections of unate functions, On basis-exchange properties for matroids, Clutters with \(\tau_ 2 \Relbar 2\tau\), Applying Lehman's theorems to packing problems, Independence and port oracles for matroids, with an application to computational learning theory