Skip to main content

A generalization of a covering problem of mullin and stanton for matroids

Contributed Papers

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

Abstract

A (q,m,k) cover of V(k,q), the vector space of k-tuples over GF(q), is a subset of the non-zero vectors of V(k,q) which has rank k and has non-empty intersection with every subspace of V(k,q) of rank k−m. A (q,m,k) cover may also be viewed as a matroid. As such it is essentially the image in V(k,q) of a restriction M of PG(k−1,q) under some representation, where M has rank k and critical exponent greater than m. An earlier paper answered several questions of Mullin and Stanton concerning (2,m,k) covers. This paper answers the corresponding questions for (q,m,k) covers when q>2. In particular, the least number η(q,m,k) of elements in a (q,m,k) cover is determined and those matroids having exactly η(q,m,k) elements are characterized.

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. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (Macmillan, London; American Elsevier, New York, 1976).

    CrossRef  MATH  Google Scholar 

  2. R.C. Bose and R.C. Burton, A characterization of flat spaces in a finite geometry and the uniqueness of the Hamming and the MacDonald codes. J. Combinatorial Thoery, 1 (1966), 96–104.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Thomas H. Brylawski, An affine representation for transversal geometries. Studies in Appl. Math., 54 (1975), 143–160.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Henry H. Crapo and Gian-Carlo Rota, On the Foundations of Combinatorial Theory: Combinatorial Geometries (Preliminary ed., M.I.T. Press, Cambridge, Massachusetts; London, 1970).

    Google Scholar 

  5. G.A. Dirac, The structure of k-chromatic graphs. Fund. Math., 40 (1953), 42–55.

    MathSciNet  MATH  Google Scholar 

  6. R.C. Mullin and R.G. Stanton, A covering problem in binary spaces of finite dimension. Graph Theory and Related Topics (eds. J.A. Bondy and U.S.R. Murty, Academic Press, London, New York, San Francisco, to appear).

    Google Scholar 

  7. James G. Oxley, Colouring, packing and the critical problem. Quart. J. Math. Oxford (2), 29 (1978), 11–22.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. James G. Oxley, On a covering problem of Mullin and Stanton for binary matroids. Aequationes Math. (to appear).

    Google Scholar 

  9. D.J.A. Welsh, Matroid Theory (London Math. Soc. Monographs No. 8, Academic Press, London, New York, San Francisco, 1976).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1979 Springer-Verlag

About this paper

Cite this paper

Oxley, J.G. (1979). A generalization of a covering problem of mullin and stanton for matroids. In: Horadam, A.F., Wallis, W.D. (eds) Combinatorial Mathematics VI. Lecture Notes in Mathematics, vol 748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0102687

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09555-2

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

  • eBook Packages: Springer Book Archive