Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-23T13:35:06.143Z Has data issue: false hasContentIssue false
  • English
  • Français

A note on matroids and block designs

Published online by Cambridge University Press:  09 April 2009

R. A. Main  and
D. J. A. Welsh
R. A. Main
Affiliation:
Mathematical Institute, University of Oxford, Oxford, U. K.
D. J. A. Welsh
Affiliation:
Mathematical Institute, University of Oxford, Oxford, U. K.
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The close connection between certain types of matroids or combinatorial geometries and block designs is well known. The relationships previously discussed have centred on the loose analogy between the blocks of a design and the hyperplanesor flats ot the matroid or geometry. The matroids which arise in this way have had in the main a very tight regular structure. Here we show that theclass of matroids whose bases are the blocks of a design ismuch wider — indeed from Theorem 6 below we obatain a metroid in a canonical way from any balanced incomplete block design in which no pair of blocks differ by exactly one element.

Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 20 , Issue 1 , August 1975 , pp. 54 - 58
Copyright
Copyright © Australian Mathematical Society 1975

References

Hall, M. (1967), Combinatorial Theory. (Blaisdell, Waltham, 1967).Google Scholar
Harary, F. and Welsh, D. J. A. (1969), Matroids versus graphs, The Many Facets of Graph Theory, (Springer Lecture Notes), 110, 155–170.CrossRefGoogle Scholar
Ingleton, A. W. (1971), (private communication).Google Scholar
Murty, U. S. R. (1970), Equicardinal matroids and finite geometries, Combinatorial Structures and their Applications (Gordon and Breach), 289–293.Google Scholar
Welsh, D. J. A. (1971), Matroids and block designs Théorie des Matroides, (Springer Lecture Notes) 211, 95–106.CrossRefGoogle Scholar
Whitney, H. (1935), ‘On the abstract properties of linear dependence’, Amer. J. Math. 57, 509–533.CrossRefGoogle Scholar
Young, P., Murty, U. S. R., and Edmonds, J. (1970), Equicardinal matroids and matroid designs, Combinatorial Mathematics and its Applications (Charel Hill), 498–542.Google Scholar