The binary matroids with no odd circuits of size exceeding five

DOI10.1016/j.jctb.2021.09.006zbMath1478.05017OpenAlexW3203216399MaRDI QIDQ2664551

Kristen Wetzler, Carolyn Chun, James G. Oxley

Publication date: 17 November 2021

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2021.09.006

zbMATH Keywords

bipartite graphEulerian graphodd circuitaffine matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

An upper bound for the circumference of a 3-connected binary matroid ⋮ Unnamed Item

Uses Software

• SageMath

Cites Work

• Unnamed Item
• The binary matroids whose only odd circuits are triangles
• On internally 4-connected non-regular binary matroids
• Kernels in perfect line-graphs
• On 3-connected matroids
• A simple theorem on 3-connectivity
• Triads and triangles in 3-connected matroids
• Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
• Connectivity in Matroids
• A Decomposition for Combinatorial Geometries

This page was built for publication: The binary matroids with no odd circuits of size exceeding five