Skip to main content
Log in

Non-Separating Cocircuits Avoiding Some Elements

  • Published:
Annals of Combinatorics Aims and scope Submit manuscript

Abstract

In this paper, we obtain a sharper lower bound for the number of connected hyperplanes of a 3-connected binary matroid M containing a fixed set A provided M|A is coloopless.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bixby, R.E., Cunningham, W.H.: Matroids, graphs, and 3-connectivity. In: Bondy, J.A., Murty, U.S.R. (eds.) Graph Theory and Related Topics, pp. 91–103. Academic Press, New York (1979)

  2. Kelmans, A.K.: The concept of a vertex in a matroid, the nonseparating cycles of a graph and a new criterion for graph planarity. In: Lovász, L., Sós, V.T. (eds.) Algebraic Methods in Graph Theory, Vol. 1. Colloq. Math. Soc. János Bolyai, Vol. 25, pp. 345–388. North Holland, Amsterdam (1981)

  3. Kelmans, A.K.: Graph planarity and related topics. In: Robertson, N., Seymour, P.D. (eds.) Graph Structure Theory. Contemp. Math., Vol. 147, pp. 635–667. Amer. Math. Soc., Providence (1991)

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

    Article  MATH  MathSciNet  Google Scholar 

  5. Lemos M.: Non-separating cocircuits in binary matroids. Linear Algebra Appl. 382, 171–178 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  6. Lemos, M.: A characterization of graphic matroids using non-separating cocircuits. Adv. Appl. Math. 42, 75–81 (2009)

  7. Lemos, M., Melo, T.R.B.: Non-separating cocircuits in matroids. Discrete Appl. Math. 156, 1019–1024 (2008)

  8. Lemos, M., Melo, T.R.B.: Connected hyperplanes in binary matroids. Linear Algebra Appl. 432(1), 259–274 (2010)

  9. Lemos, M., Reid, T.J., Wu, H.: Characterizing 3-connected planar graphs and graphic matroids. J. Graph Theory 64(2), 165–174 (2010)

  10. McNulty, J., Wu, H.: Connected hyperplanes in binary matroids. J. Combin. Theory Ser. B 79(1), 87–97 (2000)

  11. Mighton, J.: A new characterization of graphic matroids. J. Combin. Theory Ser. B 98(6), 1253–1258 (2008)

  12. Oxley, J.G.: Cocircuit coverings and packings for binary matroids. Math. Proc. Cambridge Philos. Soc. 83(3), 347–351 (1978)

  13. Oxley, J.: Matroid Theory. Second edition. Oxford Univ. Press, New York (2011)

  14. Tutte, W.T.: How to draw a graph. Proc. London Math. Soc. (3) 13, 743–768 (1963)

  15. Tutte, W.T.: Lectures on matroids. J. Res. Nat. Bur. Standards Sect. B 69B, 1–47 (1965)

  16. Tutte, W.T.: Connectivity in matroids. Canad. J. Math. 18, 1301–1324 (1966)

  17. Tutte, W.T.: On even matroids. J. Res. Nat. Bur. Standards Sect. B 71B, 213–214 (1967)

  18. Wagner, D.K.: On Mighton’s characterization of graphic matroids. J. Combin. Theory Ser. B 100(5), 493–496 (2010)

  19. Whitney, H.: 2-isomorphic graphs. Amer. J. Math. 55, 245–254 (1933)

  20. Wu, H.: Private comunication. (2004)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Manoel Lemos.

Additional information

Dedicated to James Oxley on his 60th birthday

The author is partially supported by CNPq (Grant No. 300242/2008-5).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lemos, M. Non-Separating Cocircuits Avoiding Some Elements. Ann. Comb. 19, 187–204 (2015). https://doi.org/10.1007/s00026-015-0255-z

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00026-015-0255-z

Mathematics Subject Classification

Keywords

Navigation