Skip to main content
Article
On Critical Circuits in k-Connected Matroids
Graphs and Combinatorics
  • João Paulo Costalonga
  • Kecai Deng
  • Xiangqian Zhou, Wright State University - Main Campus
Document Type
Article
Publication Date
11-1-2018
Abstract

We show that, for every integer k≥ 4 , if M is a k-connected matroid and C is a circuit of M such that for every e∈ C, M\ e is not k-connected, then C meets a cocircuit of size at most 2 k- 3 ; furthermore, if M is binary and k≥ 5 , then C meets a cocircuit of size at most 2 k- 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 2 k- 3 , and every minimally k-connected binary matroid has a cocircuit of size at most 2 k- 4.

DOI
10.1007/s00373-018-1974-9
Citation Information
João Paulo Costalonga, Kecai Deng and Xiangqian Zhou. "On Critical Circuits in k-Connected Matroids" Graphs and Combinatorics Vol. 34 Iss. 6 (2018) p. 1589 - 1595 ISSN: 09110119
Available at: http://works.bepress.com/xiangqian_zhou/10/