Abstract
Ulam-type reconstruction problems are given for combinatorial geometries. In particular the subgeometry generating function is evaluated from the subgeometry generating functions of single element deletions. This result is applied to graphs to give the chromatic polynomial (for vertices or regions) and a number of other invariants which can be computed from the deck of edge deletions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brylawski, T. H., A Decomposition for Combinatorial Geometries, Trans. Amer. Math. Soc. 171 (1972), 235–282.
Crapo, H. H., and Rota, G.-C., Combinatorial Geometries, M.I.T. Press, Cambridge, Mass., 1970.
Greenwell, D. L., and Hemminger, R. L., Reconstructing Graphs, The Many Facets of Graph Theory, Springer-Verlag, Berlin (1969), 91–114.
Harary, F., A Seminar on Graph Theory, Holt, Rinehart, and Winston, New York, New York, 1967.
Harary, F., and Welsh, D. J. A., Matroids Versus Graphs, The Many Facets of Graph Theory, Springer-Verlag, Berlin (1969), 155–170.
Stanley, R., Acyclic Orientation of Graphs, (to appear).
Tutte, W. T., Lectures on Matroids, J. Res. Nat. Bur. Stand. 69B(1965), 1–48.
Ulam, S. M., A Collection of Mathematical Problems, Wiley, New York, (1960), 29.
Whitney, H., 2-isomorphic Graphs, Amer. J. Math. 55 (1933), 245–254.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin
About this paper
Cite this paper
Brylawski, T.H. (1974). Reconstructing combinatorial geometries. In: Bari, R.A., Harary, F. (eds) Graphs and Combinatorics. Lecture Notes in Mathematics, vol 406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066444
Download citation
DOI: https://doi.org/10.1007/BFb0066444
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06854-9
Online ISBN: 978-3-540-37809-9
eBook Packages: Springer Book Archive