Skip to main content

The Two-Point Fano and Ideal Binary Clutters

  • Conference paper
  • First Online:
Book cover Integer Programming and Combinatorial Optimization (IPCO 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10328))

  • 1479 Accesses

Abstract

Let \({\mathbb {F}}\) be a binary clutter. We prove that if \({\mathbb {F}}\) is non-ideal, then either \({\mathbb {F}}\) or its blocker \(b({\mathbb {F}})\) has one of \({\mathbb {L}}_7,{\mathbb {O}}_5,{\mathbb {L}}{\mathbb {C}}_7\) as a minor. \({\mathbb {L}}_7\) is the non-ideal clutter of the lines of the Fano plane, \({\mathbb {O}}_5\) is the non-ideal clutter of odd circuits of the complete graph \(K_5\), and the two-point Fano \({\mathbb {L}}{\mathbb {C}}_7\) is the ideal clutter whose sets are the lines, and their complements, of the Fano plane that contain exactly one of two fixed points. In fact, we prove the following stronger statement: if \({\mathbb {F}}\) is a minimally non-ideal binary clutter different from \({\mathbb {L}}_7,{\mathbb {O}}_5,b({\mathbb {O}}_5)\), then through every element, either \({\mathbb {F}}\) or \(b({\mathbb {F}})\) has a two-point Fano minor.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Given sets AB we denote by \(A-B\) the set \(\{a\in A:a\notin B\}\) and, for element a, we write \(A-a\) instead of \(A-\{a\}\).

References

  1. Abdi, A., Guenin, B.: The minimally non-ideal binary clutters with a triangle (Submitted)

    Google Scholar 

  2. Bridges, W.G., Ryser, H.J.: Combinatorial designs and related systems. J. Algebra 13, 432–446 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cornuéjols, G.: Combinatorial Optimization, Packing and Covering. SIAM, Philadelphia (2001)

    Book  MATH  Google Scholar 

  4. Cornuéjols, G., Guenin, B.: Ideal binary clutters, connectivity, and a conjecture of Seymour. SIAM J. Discrete Math. 15(3), 329–352 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Edmonds, J., Fulkerson, D.R.: Bottleneck extrema. J. Combin. Theory Ser. B 8, 299–306 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Can. J. Math. 8, 399–404 (1956)

    Article  MathSciNet  MATH  Google Scholar 

  7. Guenin, B.: A characterization of weakly bipartite graphs. J. Combin. Theory Ser. B 83, 112–168 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Guenin, B.: Integral polyhedra related to even-cycle and even-cut matroids. Math. Oper. Res. 27(4), 693–710 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lehman, A.: A solution of the Shannon switching game. Soc. Ind. Appl. Math. 12(4), 687–725 (1964)

    Article  MathSciNet  MATH  Google Scholar 

  10. Lehman, A.: On the width-length inequality. Math. Program. 17(1), 403–417 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lehman, A.: The width-length inequality and degenerate projective planes. In: DIMACS, vol. 1, pp. 101–105 (1990)

    Google Scholar 

  12. Menger, K.: Zur allgemeinen Kurventheorie. Fundamenta Mathematicae 10, 96–115 (1927)

    MATH  Google Scholar 

  13. Novick, B., Sebő, A.: On combinatorial properties of binary spaces. In: Balas, E., Clausen, J. (eds.) IPCO 1995. LNCS, vol. 920, pp. 212–227. Springer, Heidelberg (1995). doi:10.1007/3-540-59408-6_53

    Chapter  Google Scholar 

  14. Oxley, J.: Matroid Theory, 2nd edn. Oxford University Press, New York (2011)

    Book  MATH  Google Scholar 

  15. Seymour, P.D.: On Lehman’s width-length characterization. In: DIMACS, vol. 1, pp. 107–117 (1990)

    Google Scholar 

  16. Seymour, P.D.: The forbidden minors of binary matrices. J. Lond. Math. Soc. 2(12), 356–360 (1976)

    Article  MATH  Google Scholar 

  17. Seymour, P.D.: The matroids with the max-flow min-cut property. J. Combin. Theory Ser. B 23, 189–222 (1977)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ahmad Abdi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Abdi, A., Guenin, B. (2017). The Two-Point Fano and Ideal Binary Clutters. In: Eisenbrand, F., Koenemann, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 2017. Lecture Notes in Computer Science(), vol 10328. Springer, Cham. https://doi.org/10.1007/978-3-319-59250-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-59250-3_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-59249-7

  • Online ISBN: 978-3-319-59250-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics