Skip to main content

Extremal problems with excluded subgraphs in the n-cube

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

Keywords

  • Complete Graph
  • Adjacent Edge
  • Element Subset
  • Weight Code
  • Constant Weight Code

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

    CrossRef  MathSciNet  MATH  Google Scholar 

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

    CrossRef  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.

    CrossRef  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.

    CrossRef  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

Authors

Editor information

Editors and Affiliations

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