The 3-connected binary matroids with circumference 6 or 7

DOI10.1016/J.EJC.2008.12.001MaRDI QIDQ1041600zbMATH OpenOpenAlexFDO

Authors Raul Cordovil, Bráulio jun. Maia, Manoel Lemos

Publication date 3 December 2009

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2008.12.001

zbMATH Keywords

3-connected matroidbinary matroidcircumference of a matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Review text

For a matroid \(M\) that has a circuit, \(\text{circ}(M)\) denotes the circumference of \(M\), that is, the maximum cardinality of a circuit of \(M\). Recently, the circumference of a matroid has appeared in some bounds; [see \textit{M. Lemos} and \textit{J. Oxley}, Discrete Math. 189, No.\,1-3, 283-289 (1998; Zbl 0956.05029); J. Graph Theory 30, No.\,1, 51--66 (1999; Zbl 0933.05086); Discrete Math. 220, No.\,1-3, 145--157 (2000; Zbl 0951.05020)]. The results of this paper are used in \textit{R. Cordovil, B. M. Junior,} and \textit{M. Lemos} [Discrete Math. 309, No.\,4, 655--665 (2009; Zbl 1169.05012)] to improve a lower bound of \textit{M. Lemos} and \textit{J. Oxley} [Discrete Math. 220, No.,1-3, 145--157 (2000; Zbl 0951.05020] for the size of a 3-connected binary matroid having a circuit whose deletion originates also a 3-connected matroid. In this paper, the authors construct all 3-connected binary matroids with circumference equal to 6 or 7 having large rank. Moreover, they conjecture that the following problems are very difficult: {\parindent=5mm \begin{itemize}\item[1.]constructing all 3-connected matroids with circumference 6 or 7 (and large rank), \item[2.]constructing all the 3-connected binary matroids with circumference 8. \end{itemize}}

Recommendations

• The 3-connected matroids with circumference 6
• The 3-connected binary matroids with circumference 8. I
• An upper bound for the circumference of a 3-connected binary matroid
• On minimally 3-connected binary matroids
• Minimally 3-connected binary matroids
• Connected matroids with a small circumference
• On Nonbinary 3-Connected Matroids
• The number of elements belonging to triads in 3-connected binary matroids
• On size, circumference and circuit removal in 3-connected matroids
• On Vertex-Triads in 3-Connected Binary Matroids

Cites work

• A sharp bound on the size of a connected matroid
• Connected matroids with a small circumference
• Decomposition of regular matroids
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• Matroids having small circumference
• On 3-connected matroids
• On packing minors into connected matroids
• On removable circuits in graphs and matroids
• On size, circumference and circuit removal in 3-connected matroids
• On the excluded minors for quaternary matroids
• Ramsey numbers for matroids
• Removing circuits in 3-connected binary matroids

Cited in

(9)

• Removing circuits in 3-connected binary matroids
• On size, circumference and circuit removal in 3-connected matroids
• Connected matroids with a small circumference
• On the circuit-spectrum of binary matroids
• Characterizations of matroids with an element lying in a restricted number of circuits
• An upper bound for the circumference of a 3-connected binary matroid
• 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: The 3-connected binary matroids with circumference 6 or 7

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