Abstract
A hypergraph H = (X, E) = (E1,E2,…,Em) = (Ei: i ∈ M) is a family E of subsets Ei of a set X = {xj: j ∈ N} of vertices. The sets Ei are called edges.
This is a preview of subscription content, log in via an institution to check access.
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
Berge, C.. Graphs and hypergraphs, North Holland Publ. Coy., Amsterdam, 1973.
Berge, C. & R. Rado, On isomorphic hypergraphs, and some extensions of Whitney’s theorem to families of sets, J. Combinatorial Theory B, 13 (1972) 226–241.
Dauber, E., in: Harary, F., Graph theory, Addison-Wesley, Reading, Mass., 1969, p. 172.
Lovász, L., A note on the line reconstruction problem, J. Combinatorial Theory B, 13 (1972) 309–310.
Lovász, L., Private communication.
Whitney, H., Congruent graphs and the connectivity of graphs, Amer. J. Math., 54 (1932) 160–168.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Mathematical Centre, Amsterdam
About this paper
Cite this paper
Berge, C. (1975). Isomorphism Problems for Hypergraphs. In: Hall, M., van Lint, J.H. (eds) Combinatorics. NATO Advanced Study Institutes Series, vol 16. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-1826-5_10
Download citation
DOI: https://doi.org/10.1007/978-94-010-1826-5_10
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-1828-9
Online ISBN: 978-94-010-1826-5
eBook Packages: Springer Book Archive