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

DOI10.37236/11462MaRDI QIDQ2692185zbMATH OpenOpenAlexFDO

Authors Manoel Lemos, James Oxley

Publication date 21 March 2023

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.37236/11462

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

loopless connected binary matroidodd circuit

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Review text

Summary: \textit{J. Geelen} and \textit{P. Nelson} [Combinatorica 37, No. 1, 41--47 (2017; Zbl 1399.05026)] proved that, for a loopless connected binary matroid \(M\) with an odd circuit, if a largest odd circuit of \(M\) has \(k\) elements, then a largest circuit of \(M\) has at most \(2k-2\) elements. The goal of this note is to show that, when \(M\) is \(3\)-connected, either \(M\) has a spanning circuit, or a largest circuit of \(M\) has at most \(2k-4\) elements. Moreover, the latter holds when \(M\) is regular of rank at least four.

Recommendations

• Polynomial invariants of torus knots and (p,q)-calculus
• Knot theory and the dynamics of quantum general relativity
• A relation between the Kauffman and the HOMFLY polynomials for torus knots
• The Jones polynomial and skein-invariants in knot theory
• Generalized Alexander polynomial invariants

Cites work

• Connected matroids with a small circumference
• Decomposition of regular matroids
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• Lectures on matroids
• Matroids having small circumference
• On size, circumference and circuit removal in 3-connected matroids
• On the circuit-spectrum of binary matroids
• Relations between the circumference and \(e\)-circumference of a matroid
• The 3-connected binary matroids with circumference 6 or 7
• The 3-connected matroids with circumference 6
• The binary matroids whose only odd circuits are triangles
• The binary matroids with no odd circuits of size exceeding five

Cited in

(9)

• The 3-connected binary matroids with circumference 6 or 7
• Odd circuits in dense binary matroids
• The binary matroids with no odd circuits of size exceeding five
• A sharp bound on the size of a connected matroid
• The binary matroids whose only odd circuits are triangles
• Polynomial invariants of torus knots and (p,q)-calculus
• The 3-connected binary matroids with circumference 8. I
• The 3-connected binary matroids with circumference 8. II
• The 3-connected matroids with circumference 6

This page was built for publication: An upper bound for the circumference of a 3-connected binary matroid

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