Triples in matroid circuits
This paper considers the problem of characterizing those matroids for which some triple of elements is not contained in a circuit. This problem was solved for graphic and cographic matroids by \textit{M. Watkins} and \textit{D. Mesner} [Can. J. Math. 19, 1319-1328 (1967; Zbl 0205.285)] and \textit{Chakravarti} and \textit{Robertson} [Ann. Discrete Math. 8, 247 (1980)], respectively. In this paper, the author generalizes these two results by solving the problem for all binary matroids. For non-binary matroids, the problem is still open. The author's first step is to show that, in the binary case, it suffices to solve the problem when the matroid M is 3-connected and internally 4-connected. The latter condition forbids the existence of a partition of E(M) into subsets X and Y, each having at least four elements, such that \(r(X)+r(Y)-r(M)\leq 2\). The main result of the paper is that if e, f and g are distinct elements in a 3- connected, internally 4-connected binary matroid M, then M has no circuit containing \(\{\) e,f,g\(\}\) if and only if \(\{\) e,f,g\(\}\) is a cocircuit, or M is isomorphic to the cycle matroid of a graph in which e,f and g are edges sharing a common endpoint.
- 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
- Proof of a conjecture of Kahn for non-binary matroids
- A matroid generalization of a result of Dirac
- Adjacency, inseparability, and base orderability in matroids
- A notion of minor-based matroid connectivity
- The matroid structure of representative triple sets and triple-closure computation
- Characterizations of matroids with an element lying in a restricted number of circuits
- A modular triple characterization of circuit signatures
- The binary matroids with no odd circuits of size exceeding five
- The binary matroids whose only odd circuits are triangles
- Circulant association schemes on triples
- Bonds with parity constraints
- On Vertex-Triads in 3-Connected Binary Matroids
- Trilateral matroids induced by n₃-configurations
- A binary-matroid analogue of a graph connectivity theorem of Jamison and Mulder
- On matroids with few circuits containing a pair of elements
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)
