Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference7 articles.
1. V. Bryant and H. Perfect, Some characterization theorems for circuit spaces associated with graphs, Diser. Math., to appear.
2. V. W. Bryant, J. E. Dawson, and H. Perfect, Hereditary circuit spaces, to appear.
3. A rank inequality for finite geometric lattices;Greene;J. Combinatorial Theory,1970
4. A. W. Ingleton, “Conditions for Representability and Transversality of Matroids,” Springer Lecture Notes 211, pp. 62–66, Springer-Verlag, Berlin.
5. J. H. Mason, “A Characterization of Transversal Independence Spaces,” Springer Lecture Notes 211, pp. 86–94, Springer-Verlag, Berlin.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Some extremal connectivity results for matroids;Journal of Combinatorial Theory, Series B;1991-07
2. Balanced sets in an independence structure induced by a submodular function;Journal of Mathematical Analysis and Applications;1983-08
3. Designs and circuit bases;Archiv der Mathematik;1978-12