Skip to main content
Log in

On Critical Circuits in k-Connected Matroids

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

We show that, for every integer \(k \ge 4\), if M is a k-connected matroid and C is a circuit of M such that for every \(e \in C\), \(M\backslash e\) is not k-connected, then C meets a cocircuit of size at most \(2k -3\); furthermore, if M is binary and \(k \ge 5\), then C meets a cocircuit of size at most \(2k-4\). It follows from our results and a result of Reid et al  [5] that every minimally k-connected matroid has a cocircuit of size at most \(2k-3\), and every minimally k-connected binary matroid has a cocircuit of size at most \(2k-4\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

References

  1. Lemos, M.: On \(3\)-connected matroids. Discrete Math. 73, 273–283 (1989)

    Article  MathSciNet  Google Scholar 

  2. Leo, J.W.: Triads and triangles in \(3\)-connected matroids. Discrete Math. 194, 173–193 (1999)

    Article  MathSciNet  Google Scholar 

  3. Murty, U.S.R.: Extremal critically connected matroids. Discrete Math. 8, 49–58 (1974)

    Article  MathSciNet  Google Scholar 

  4. Oxley, J.G.: Matroid Theory. Oxford University Press, New York (1992)

    MATH  Google Scholar 

  5. Reid, T.J., Wu, H., Zhou, X.: On: Minimally k-connected matroids. J. Comb. Theory Ser. B 98, 1311–1324 (2008)

    Article  MathSciNet  Google Scholar 

  6. Tutte, W.T.: Connectivity in matroids. Can. J. Math. 18, 737–744 (1966)

    Article  MathSciNet  Google Scholar 

  7. Wong, P.K.: On certain n-connected matroids. J. Reine Angew. Math 299(300), 1–6 (1978)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiangqian Zhou.

Additional information

The Kecai Deng is supported by National Science Foundation of China (No.11501223, No.11701195, and No.11471273), Science Foundation of Fujian Province, China (No.2016J05009), and Research Funds of Huaqiao University (No.16BS808).

The Xiangqian Zhou is supported by MingJiang Scholar Program hosted by Huaqiao University.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Costalonga, J.P., Deng, K. & Zhou, X. On Critical Circuits in k-Connected Matroids. Graphs and Combinatorics 34, 1589–1595 (2018). https://doi.org/10.1007/s00373-018-1974-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-018-1974-9

Keywords

Mathematics Subject Classification

Navigation