Skip to main content

Hypergraph reconstruction

Part I: General Hypergraphs

Part of the Lecture Notes in Mathematics book series (LNM,volume 411)

Keywords

  • Nonempty Subset
  • Combinatorial Theory
  • Identical Fashion
  • Element Subset
  • Graph Reconstruction

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Berge, Graphes et Hypergraphes, Dunod, Paris, 1970.

    MATH  Google Scholar 

  2. C. Berge and R. Rado, "Note on isomorphic hypergraphs and some extensions of Whitney’s Theorem to families of sets," to appear in Journal Of Combinatorial Theory.

    Google Scholar 

  3. V. Faber, "Reconstruction of graphs from indexes p-2 point subgraphs," Notices of Amer. Math. Soc. 18(1971)807.

    Google Scholar 

  4. D. L. Greenwell, "Reconstructing graphs," Proc. Amer. Math. Soc. 30(1971)431–433.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. D. L. Greenwell and R.L. Hemminger, "Reconstructing graphs," The Many Facets of Graph Theory (G. T. Chartrand and S. F. Kapoor, eds.) springer-Verlag, New York, 1969.

    Google Scholar 

  6. P. J. Kelly, "A congruence theorem for trees," Pac. J. Math. 7(1957)961–968.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. —, "On some mappings related to graphs," Pac. J. Math. 14(1964)191–194.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. P. V. O’Neil, "Ulam’s conjecture and graph reconstructions," Am. Math. Monthly 77(1970)35–43.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. S.M. Ulam, A Collection of Mathematical Problems, Wiley (Interscience), New York, 1960.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1974 Springer-Verlag

About this paper

Cite this paper

Faber, V. (1974). Hypergraph reconstruction. In: Berge, C., Ray-Chaudhuri, D. (eds) Hypergraph Seminar. Lecture Notes in Mathematics, vol 411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066182

Download citation

  • DOI: https://doi.org/10.1007/BFb0066182

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06846-4

  • Online ISBN: 978-3-540-37803-7

  • eBook Packages: Springer Book Archive