Skip to main content
SpringerLink
Log in
Book cover

Graph Theory pp 84–93Cite as

Extremal problems with excluded subgraphs in the n-cube

  • Conference paper
  • First Online:

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

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (USA)
  • 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. B. Bollobás, On generalized graphs, Acta Math. Acad. Sci. Hungar., 16 (1965), 447–452.

    Article  MathSciNet  MATH  Google Scholar 

  2. P. Erdös, On a lemma of Littlewood and Offord, Bull. Amer. Math. Soc., 51 (1945), 898–902.

    Article  MathSciNet  MATH  Google Scholar 

  3. R.L. Graham and H.J.A, Sloane, Lower bounds for constant weight codes, IEEE IT-26, (1980), 37–43.

    Google Scholar 

  4. G.O.H. Katona, Extremal problems for hypergraphs, in: M. Hall, Jr. and J.H. van Lint (eds.), Combinatorics, D. Reidel Publishing Company, (1975), 215–244.

    Google Scholar 

  5. D.J. Kleitman, Extremal properties of collections of subsets containing no two sets and their union, J. Combinatorial Th., A. 20 (1976), 390–392.

    Article  MathSciNet  MATH  Google Scholar 

  6. F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North Holland, (1977).

    Google Scholar 

  7. E. Sperner, Ein Satz über Untermenge einer endlichen Menge, Math. Z., 27 (1928), 544–548.

    Article  MathSciNet  MATH  Google Scholar 

  8. T.G. Tarján, Complexity of lattice-configurations, Studia Sci. Math. Hungar, 10 (1975), 203–211.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematical Institute, Hungarian Academy of Sciences, Reáltanoda u. 13-15, H-1053, Budapest V., Hungary

    G. O. H. Katona & T. G. Tarján

Authors
  1. G. O. H. Katona
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. T. G. Tarján
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Borowiecki John W. Kennedy Maciej M. Sysło

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag

About this paper

Cite this paper

Katona, G.O.H., Tarján, T.G. (1983). Extremal problems with excluded subgraphs in the n-cube. In: Borowiecki, M., Kennedy, J.W., Sysło, M.M. (eds) Graph Theory. Lecture Notes in Mathematics, vol 1018. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0071617

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation