Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
