Triples in matroid circuits
From MaRDI portal
Publication:1086243
DOI10.1016/S0195-6698(86)80044-0zbMATH Open0608.05023MaRDI QIDQ1086243FDOQ1086243
Authors: Paul Seymour 
Publication date: 1986
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Recommendations
- A matroid generalization of a result of Dirac
- Triads and triangles in 3-connected matroids
- A characterization of graphic matroids using non-separating cocircuits
- Regular matroids without disjoint circuits.
- Obstructions to a binary matroid being graphic
- On Vertex-Triads in 3-Connected Binary Matroids
- On matroids with few circuits containing a pair of elements
- On 3-connected matroids
- A characterization of graphic matroids based on circuit orderings
- Bonds with parity constraints
Combinatorial aspects of matroids and geometric lattices (05B35) Paths and cycles (05C38) Connectivity (05C40)
Cites Work
Cited In (14)
- A notion of minor-based matroid connectivity
- Characterizations of matroids with an element lying in a restricted number of circuits
- The binary matroids whose only odd circuits are triangles
- The matroid structure of representative triple sets and triple-closure computation
- Bonds with parity constraints
- A matroid generalization of a result of Dirac
- A modular triple characterization of circuit signatures
- The binary matroids with no odd circuits of size exceeding five
- Trilateral matroids induced by \(n_3\)-configurations
- On matroids with few circuits containing a pair of elements
- Circulant association schemes on triples
- Adjacency, inseparability, and base orderability in matroids
- A binary-matroid analogue of a graph connectivity theorem of Jamison and Mulder
- Proof of a conjecture of Kahn for non-binary matroids
This page was built for publication: Triples in matroid circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086243)
