Hostname: page-component-76fb5796d-9pm4c Total loading time: 0 Render date: 2024-04-27T00:12:29.768Z Has data issue: false hasContentIssue false
  • English
  • Français

Removable Circuits in Binary Matroids

Published online by Cambridge University Press:  01 November 1999

LUIS A. GODDYN  and
BILL JACKSON
LUIS A. GODDYN
Affiliation:
Department of Mathematics and Statistics, Simon Fraser University, Burnaby, BC, V5A 1S6, Canada (e-mail: goddyn@math.sfu.ca)
BILL JACKSON
Affiliation:
Department of Mathematical and Computing Sciences, Goldsmiths' College, London SE14 6NW, England (e-mail: WXJ@gold.ac.uk)
Get access Rights & Permissions [Opens in a new window]

Abstract

We show that, if M is a connected binary matroid of cogirth at least five which does not have both an F7-minor and an F*7-minor, then M has a circuit C such that M − C is connected and r(M − C) = r(M).

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 8 , Issue 6 , November 1999 , pp. 539 - 545
Copyright
© 1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)