Techniques in matroid reconstruction

Discrete Mathematics

Volumn 170, Issue 1-3, 1997, Pages 173-183

  Miller, William P ^a  

^a GEORGE WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0005954333     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00227-N     Document Type: Article

References (26)

1. M. Aigner, Uniformität des Verbandes der Partitionen, Math. Ann. 207 (1974) 1-22.
2. M.K. Bennett, K.P. Bogart and J. Bonin, The geometry of Dowling lattices, Adv. Math. 103 (1994) 131-161.
3. J.A. Bondy, A graph reconstructor's manual, in: A.D. Keedwell, ed., Surveys in Combinatorics, London Mathematical Society Lecture Note Series, vol. 166 (Cambridge University Press, Cambridge, 1991) 221-252.
4. J.A. Bondy and R.C. Hemminger, Graph reconstruction - A survey, J. Graph Theory 1 (1977) 227-268.
5. J.E. Bonin and K.P. Bogart, A geometric characterization of Dowling lattices, J. Combin. Theory Ser. A 56 (1991) 195-202.
6. T.H. Brylawski, Reconstructing combinatorial geometries, Graphs and Combinatorics, Lecture Notes in Mathematics, vol. 406 (Springer, New York, 1974) 226-235'
7. T.H. Brylawski, On the nonreconstructibility of combinatorial geometries, J. Combin. Theory Ser. B 19 (1995) 72-76.
8. T.H. Brylawski, Hyperplane reconstruction of the Tutte polynomial of a geometric lattice, Discrete Math. 35 (1981) 25-38.
9. T.H. Brylawski, Constructions, in: N. White, ed., Theory of Matroids (Cambridge University Press, Cambridge, 1986) 127-223.
10. T.A. Dowling, Codes, packings and the critical problem, in: A. Barlotti, ed., Atti del Convegno di Geometria Combinatoria e sue Applicazioni (Univ. Perugia, Perugia, Italy, 1971) 209-224.
11. T.A. Dowling, A class of geometric lattices based on finite groups, J. Combin. Theory Ser. B 14 (1973) 61-86. Erratum, same journal, 15 (1973) 211.
12. M.D. Halsey, Line-closed combinatorial geometries, Discrete Math. 65 (1987) 245-248.
13. F. Harary, On the reconstruction of a graph from a collection of subgraphs, in: M. Fiedler, ed., Theory of Graphs and its Applications (Proceedings of the Symposium held in Prague, 1964, Czechoslovak Academy of Sciences, Prague; reprinted by Academic Press, New York, 1964) 47-52.
14. J. Kahn and J.P.S. Kung, Varieties of combinatorial geometries, Trans. Amer. Math. Soc. 271 (1982) 485-499.
15. J. Kahn and J.P.S. Kung, A classification of modularly complemented geometric lattices, European J. ombin. 7 (1986) 243-248.
16. P.J. Kelly, On isometric transformations, Ph.D. Thesis. University of Wisconsin, 1942.
17. W.P. Miller, Approaches to matroid reconstruction problems, Ph.D. Thesis. The George Washington University, 1995.
18. J.G. Oxley, Matroid Theory (Oxford University Press, Oxford, 1992).
19. J.R. Stonesifer and K.P. Bogart, Characterizations of partition lattices, Algebra Universalis 19 (1984) 92-98.
20. W.T. Tutte, All the king's horses (A guide to reconstruction), in: J.A. Bondy and U.S.R. Murty, eds., Graph Theory and Related Topics (Academic Press, New York, 1979) 15-23.
21. W.T. Tutte, Graph Theory (Addison-Wesley, Menlow Park, 1984).
22. S.M. Ulam, A Collection of Mathematical Problems (Wiley-Interscience, New York, 1960). Second edition: Problems in Modern Mathematics (1964).
23. S.M. Ulam, A Collection of Mathematical Problems (Wiley-Interscience, New York, 1960). Second edition: Problems in Modern Mathematics (1964).
24. Y. Yoon, Characterizations for some combinatorial geometries, Ph.D. Thesis, University of North Texas, 1992.
25. T. Zaslavsky, Facing up to arrangements: face-count formulas for partitions of space by hyperplanes, Mem. Amer. Math. Soc. 1, Issue 1, No. 154 (1975).
26. T. Zaslavsky, The Möbius function and the characteristic polynomial, in: N. White, ed., Combinatorial Geometries (Cambridge University Press, Cambridge, 1987) 114-138.