Skip to main content

Interpolation antichains in lattices

Part of the Lecture Notes in Mathematics book series (LNM,volume 1149)

Keywords

  • Discrete Math
  • Grade Function
  • Face Lattice
  • Maximal Chain
  • Combinatorial Theory

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Astie-Vidal, Factor group of the automorphism group of a matroid basis graph with respect to the automorphism group of the matroid, Discrete Math. 32(1980), 217–224.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. G. Birkhoff, Lattice Theory, Third Edition, Amer. Math. Soc., Providence, 1967.

    MATH  Google Scholar 

  3. J.D. Donald, C.A. Holzmann, and M.D. Tobey, A characterization of complete matroid basis graphs, J. Combinatorial Theory B 22 (1977), 139–158.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. M.L. Dubreil-Jacotin, L. Lesieur and R. Croisot, Leçons sur la théorie des treillis, des structures algebriques, et des treillis geométriques, Gauthier-Villars, Paris, 1953.

    MATH  Google Scholar 

  5. D. Duffus and I. Rival, Path length in the covering graph of a lattice, Discrete Math. 19(1977), 139–158.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. S. Krogdahl, The dependence graph for bases in matroids, Discrete Math. 19(1977), 47–59.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. S.B. Maurer, Matroid basis graphs I, J. Combinatorial Theory B 14(1973), 216–240.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. S.B. Maurer, Matroid basis graphs II, J. Combinatorial Theory B 15(1973), 121–145.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. S.B. Maurer, Intervals in matroid basis graphs, Discrete Math. 11(1975), 147–159.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. S.B. Maurer, A maximal-rank minimum-term-rank theorem for matroids, Linear Algebra and Appl. 10(1975), 129–137.

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. L. Oubiña, Localisation d’une propriété du graphe des bases d’un matroide binaire, Colloques internationaux C.N.R.S. No. 260 (Problèmes combinatoires et théorie des graphes), Paris-Orsay, 1978, pp. 323–324.

    Google Scholar 

  12. L. Pezzoli, Sistemi di indipendenza modulari, Boll. Un. Mat. Ital. B (5) 18(1981), 575–590.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1985 Springer-Verlag

About this paper

Cite this paper

Higgs, D. (1985). Interpolation antichains in lattices. In: Comer, S.D. (eds) Universal Algebra and Lattice Theory. Lecture Notes in Mathematics, vol 1149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0098461

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15691-8

  • Online ISBN: 978-3-540-39638-3

  • eBook Packages: Springer Book Archive