The binary matroids whose only odd circuits are triangles

DOI10.1016/J.AAM.2016.01.006MaRDI QIDQ272893zbMATH OpenOpenAlexFDO

Authors Kristen Wetzler, James Oxley

Publication date 21 April 2016

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.aam.2016.01.006

zbMATH Keywords

bipartiteaffine binary matroidEulerian graphodd circuit

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)

Recommendations

• The binary matroids with no odd circuits of size exceeding five
• Triples in matroid circuits
• An upper bound for the circumference of a 3-connected binary matroid
• Turán's triangle theorem and binary matroids
• Odd circuits in dense binary matroids

Cites work

• scientific article; zbMATH DE number 3625416 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• scientific article; zbMATH DE number 3326386 (Why is no real title available?)
• A Combinatorial Model for Series-Parallel Networks
• A Decomposition for Combinatorial Geometries
• Euler and bipartite matroids
• Kernels in perfect line-graphs

Cited in

(7)

• An upper bound for the circumference of a 3-connected binary matroid
• Bonds with parity constraints
• A geometric version of the Andrásfai-Erdős-Sós theorem
• The binary matroids with no odd circuits of size exceeding five
• Turán's triangle theorem and binary matroids
• On bipartite restrictions of binary matroids
• A binary-matroid analogue of a graph connectivity theorem of Jamison and Mulder

This page was built for publication: The binary matroids whose only odd circuits are triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q272893)