Skip to main content
SpringerLink
Log in

On the 3-Connected Matroids That are Minimal Having a Fixed Restriction

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 Let N be a restriction of a 3-connected matroid M and let M ′ be a 3-connected minor of M that is minimal having N as a restriction. This paper gives a best-possible upper bound on |E(M ′)−E(N)|.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1.  Departamento de Matemática, Universidade Federal de Pernambuco, Recife, Pernambuco 50740-540, Brazil. e-mail: manoel@dmat.ufpe.br, , , , , , BR

    Manoel Lemos

  2.  Department of Mathematics, Louisiana State University, Baton Rouge, LA 70803-4918, USA. e-mail: oxley@math.lsu.edu, , , , , , US

    James Oxley

  3.  Department of Mathematics, University of Mississippi, University, MS 38677, USA. e-mail: mmreid@hilbert.math.olemiss.edu, , , , , , US

    Talmage James Reid

Authors
  1. Manoel Lemos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. James Oxley
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Talmage James Reid
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: July 17, 1998 Revised: March 15, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lemos, M., Oxley, J. & Reid, T. On the 3-Connected Matroids That are Minimal Having a Fixed Restriction. Graphs Comb 16, 285–318 (2000). https://doi.org/10.1007/PL00007223

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00007223

Search

Navigation