Skip to main content
SpringerLink
Log in

Inseparability graphs of oriented matroids

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

We determine the inseparability graphs of uniform oriented matroids and of graphic oriented matroids. For anyr, n such that 4≦r≦n−3, examples of rankr uniform oriented matroids onn elements with a given inseparability graph are obtained by simple constructions of polytopes having prescribed separation properties.

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

We’re sorry, something doesn't seem to be working properly.

Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

References

  1. C. Berge,Graphs and hypergraphs, North Holland, Amsterdam, 1973.

    Google Scholar 

  2. R. G. Bland andM. Las Vergnas, Orientability of matroids,J. Combinatorial Theory, Ser. B 24 (1978), 94–123.

    Google Scholar 

  3. R.Cordovil and P.Duchet, On the number of signinvariant pairs of points in oriented matroids,preprint, 1984.

  4. J. Folkman andJ. Lawrence, Oriented matroids,J. Combinatorial Theory, Ser. B 25 (1978), 199–236.

    Google Scholar 

  5. J. E. Goodman andR. Pollack, Proof of Grünbaum's conjecture on the stretchability of certain arrangements of pseudolines,J. Combinatorial Theory, Ser. A 29 (1980), 385–390.

    Google Scholar 

  6. B. Grünbaum,Convex polytopes, Wiley, Interscience, London, 1967.

    Google Scholar 

  7. H. A. Jung, Eine Verallgemeinerung desn-fachen Zusammenhangs für Graphen,Math. Ann. 187 (1970), 95–103.

    Article  Google Scholar 

  8. M. Las Vergnas, Matroïdes orientables,C. R. Acad. Sci. Paris,280 (1975), 61–64.

    Google Scholar 

  9. M.Las Vergnas, Extensions ponctuelles d'une géométrie orientée,Problèmes combinatoires et théorie des graphes, Proc. Coll. Orsay (1976), Editions du C.N.R.S.

  10. J. Lawrence andL. Weinberg, Unions of oriented matroids,Linear Algebra and Appl.,41 (1981), 183–200.

    Article  Google Scholar 

  11. J. P.Raudneff, Reconstruction of the orientation class of an oriented matroid,Europ. J. Combinatorics.

  12. P. D. Seymour, Disjoint paths in graphs,Discrete Math.,29 (1980), 293–309.

    Article  Google Scholar 

  13. C. Thomassen, 2-linked graphs,Europ. J. Combinatorics 1 (1980), 371–378.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. E.H. 175 Combinatoire, U.E.R. 48, Université P. et M. Curie, 4, place Jussieu, 75 005, Paris, France

    J. -P. Roudneff

Authors
  1. J. -P. Roudneff
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Roudneff, J.P. Inseparability graphs of oriented matroids. Combinatorica 9, 75–84 (1989). https://doi.org/10.1007/BF02122686

Download citation

  • Received:

  • Issue Date:

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

AMS subject classification (1980)

Search

Navigation