Skip to main content

Advances on Extremal Problems in Number Theory and Combinatorics

  • Conference paper
European Congress of Mathematics

Part of the book series: Progress in Mathematics ((PM,volume 201))

Abstract

To keep an acceptable size, references not listed at the end are given by the Bibliography of the recent book [N] and/or the page number of [N].

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. “Numbers, Information and Complexity, Special volume in honour of R. Ahls-wede on the occasion of his 60th birthday”; I. Althöfer, N. Cai, G. Dueck, L. Khachatrian, M. S. Pinsker, A. Sârközy, I. Wegener, Z. Zhang editors. Kluwer Acad. Publ., Boston, Dordrecht, London, 2000.

    Google Scholar 

  2. R. Ahlswede, C. Bey, K. Engel and L. Khachatrian, “The t-intersection problem in the truncated boolean lattice”, submitted to European Journal of Combina-tories.

    Google Scholar 

  3. C. Bérge, “Nombres de coloration de l’hypergraphe h-parti complet”, Hyper-graph Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, Ohio, 1972; dedicated to Arnold Ross), pp. 13–20. Lecture Notes in Math., Vol. 411,Springer, Berlin, 1974.

    Google Scholar 

  4. F. Chung and R. Graham, “Erdös on graphs. His legacy of unsolved problems”,A K Peters, Ltd., Wellesley, MA, 1998.

    Google Scholar 

  5. D. E. Daykin, D. J. Kleitman and D. B. West, “On the number of meets between two subsets of a lattice”, J. Comb. Theory, Ser. A 26, 135–155, 1979.

    Article  MathSciNet  MATH  Google Scholar 

  6. P. Erdös, “Problems and results in combinatorial number theory”, ch. 12 in a Survey of Combinatorial Theory, J. N. Srivastava et al. (eds) 1973.

    Google Scholar 

  7. P. Erdös, “A survey of problems in combinatorial number theory”, Ann. Discrete Math. 6, 89–115, 1980.

    Article  MathSciNet  MATH  Google Scholar 

  8. K. Engel, “Sperner Theory”, Cambridge University Press, 1997.

    Google Scholar 

  9. P. Erdös, A. Sârközy and E. Szemerédi, “On a theorem of Behrend”, J. Austral. Math. Soc. 7, 9–16, 1967.

    Article  MathSciNet  MATH  Google Scholar 

  10. P. Erdös, A. Sârközy and E. Szemerédi, “On some extremal properties of sequences of integers”, Annales Univ. Sci. Budapest, Eötvös 12, 131–135, 1969.

    MATH  Google Scholar 

  11. P. Erdös, A. Sârközy and E. Szemerédi, “On divisibility properties of sequences of integers”, Number Theory (Colloq., Jänos Bolyai Math. Soc., Debrecen, 1968) pp. 35–49, North-Holland, Amsterdam, 1970.

    Google Scholar 

  12. P. Erdös, A. Sârközy and E. Szemerédi, “On some extremal properties of sequences of integers II”, Publications Math. 27, 117–125, 1980.

    MATH  Google Scholar 

  13. P. L. Erdös, A. Seress and L. A. Székely, “On intersecting chains in Boolean algebras”. Combinatorics, geometry and probability (Cambridge, 1993), 299–304, Cambridge Univ. Press, Cambridge, 1997.

    Chapter  Google Scholar 

  14. P. Frankl, “Intersection theorems for finite sets and geometric applications”,Proceedings of the International Congress of Mathematicians, Berkeley, USA, 1419–1430, 1986.

    Google Scholar 

  15. P. Frankl, “The Erdös-Ko-Rado Theorem is true for n = ckt”, Combinatorics (Proc. Fifth Hungarian Colloq. Keszthely, 1976), Vol. I, pp. 365–375, Colloq. Math. Soc. Janos Bolyai, 18, North-Holland, Amsterdam-New York, 1978.

    Google Scholar 

  16. P. Frankl and Z. Füredi, “The Erdös-Ko-Rado theorem for integer sequences”,SIAM J. Algebraic Discrete Methods 1, no. 4, 376–381, 1980.

    Article  MathSciNet  MATH  Google Scholar 

  17. P. Frankl and J. Pach, “On disjointly representable sets”, Combinat. 4, no. 1, 39–45, 1984.

    Article  MathSciNet  MATH  Google Scholar 

  18. R. Freud, “Paul Erdös, 80 — A Personal Account”, Period. Math. Hungar. 26(2), 87–93, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  19. R. L. Graham and J. Nesetril Eds., “The Mathematics of Paul Erdös I”,Springer-Verlag, 1997.

    Google Scholar 

  20. J. R. Griggs, J. Stahl and W. T. Trotter, “A Sperner theorem on unrelated chains of subsets”, J. Combin. Theory Ser. A 36, no. 1, 124–127, 1984.

    Google Scholar 

  21. D. J. Kleitman, “On a combinatorial conjecture of Erdös”, J. Combinatorial Theory 1, 209–214, 1966.

    Article  MathSciNet  MATH  Google Scholar 

  22. C. Pomerance and A. Sârközy, “Combinatorial Number Theory”, pp. 967–1018, in Handbook of Combinatorics, edited by R. L. Graham, M. Grötschel and L. Lovâsz. Elsevier Science B.V., Amsterdam; MIT Press, Cambridge, MA, 1995.

    Google Scholar 

  23. R. M. Wilson, “The exact bound in the Erdös-Ko-Rado theorem”, Combinator-ica 4, no. 2–3, 247–257, 1984.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Basel AG

About this paper

Cite this paper

Ahlswede, R. (2001). Advances on Extremal Problems in Number Theory and Combinatorics. In: Casacuberta, C., Miró-Roig, R.M., Verdera, J., Xambó-Descamps, S. (eds) European Congress of Mathematics. Progress in Mathematics, vol 201. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8268-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-8268-2_9

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9497-5

  • Online ISBN: 978-3-0348-8268-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics