Abstract
We survey conjectured and proven Ahlswede-type higher-order generalizations of the Erdös-Ko-Rado theorem.
This paper is dedicated to the 60th birthday of Professor Rudolf Ahlswede.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Ahlswede, N. Alon, P. L. Erdôs, M. Ruszinkó and L. A. Székely, “Intersecting systems”, Combinatorics, Probability, and Computing 6, 1997, 127–137.
R. Ahlswede and N. Cai, “Incomparability and intersection properties of Boolean interval lattices and chain posets”, Europ. J. Combinatorics, 17, 1996, 667–687.
R. Ahlswede, N. Cai, and Z. Zhang, “A new direction in extremal theory”, J. Combinatorics, Information System Sciences 19, 1994, 269–280.
R. Ahlswede and D. E. Daykin, “An inequality for the weights of two families of sets, their unions and intersections”, Z. Wahrsch. Verw. Gebiete, 43, 1978, 183–185.
R. Ahlswede and D. E. Daykin, “Inequalities for a pair of maps S x S -3 S with S a finite set”, Math. Z. 165, 1979, 267–289.
R. Ahlswede and L. H. Khachatrian, “The complete nontrivial-intersection theorem for systems of finite sets”, J. Combin. Theory Ser. A 76, 1996, 121–138.
R. Ahlswede and L. H. Khachatrian, “The complete intersection theorem for systems of finite sets”, European J. Combin. 18, 1997, 125–136.
R. Ahlswede and L. H. Khachatrian, “The maximal length of cloudantichains”, Discrete Math. 131, 1994, 9–15.
R. Ahlswede and L. H. Khachatrian, “Maximal sets of numbers not containing k + 1 pairwise coprime integers”, Acta Arith. 72, 1995, 77–100.
R. Ahlswede and L. H. Khachatrian, “Sets of integers and quasi-integers with pairwise common divisor”, Acta Arith. 74, 1996, 141–153.
R. Ahlswede and L. H. Khachatrian, “Sets of integers and quasi-integers with pairwise common divisor and a factor from a specified set of primes”, Acta Arith. 75, 1996, 259–276.
R. Ahlswede and L. H. Khachatrian, “Optimal pairs of incomparable clouds in multisets”, Graphs Combin. 12, 1996, 97–137
R. Ahlswede and Z. Zhang, “An identity in combinatorial extremal theory”, Adv. Math. 80, 1990, 137–151.
R. Ahlswede and Z. Zhang, “On cloud-antichains and related configurations”, Discrete Math. 85, 1990, 225–245.
N. Alon and B. Sudakov, “Disjoint systems”, Random Structures and Algorithms, 6, 1995, 13–20.
Eva Czabarka, “Structure of intersecting chains of subspaces in finite vector spaces”, Combinatorics, Probability, and Computing,to appear.
L. Comtet, Advanced Combinatorics, Reidel, Boston, Ma., 1974.
M. Deza and P. Frankl, “Erdös-Ko-Rado theorem — 22 years later”, SIAM J. Alg. Disc. Methods 4, 1983, 419–431.
K. Engel, “An Erdös-Ko-Rado theorem for the subcubes of a cube”, Cornbinatorica 4, 1984, 133–140.
P. Erdös, C. Ko and R. Rado, “Intersection theorems for systems of finite sets”, Quart. J. Math. Oxford Ser. 2 12, 1961, 313–318.
P. Erdös, R. Rado, “A combinatorial theorem”, J. London. Math. Soc. 25, 1950, 249–255.
P. L. Erdös, U. Faigle and W. Kern, “A group-theoretic setting for some intersecting Sperner families”, Combinatorics, Probability and Computing 1, 1992, 323–334.
P. L. Erdös, Â. Seress and L. A. Székely, “On intersecting chains in Boolean algebras”, Combinatorics, Probability, and Computing 3, (1994), 57–62. Reprinted in Combinatorics, Geometry, and Probability. A tribute to Paul Erdös. Papers from the Conference in Honor of Erdös’ 80th Birthday held at Trinity College, Cambridge, March 1993. Eds. B. Bollobds and A. Thomason, Partial reprinting of Combinatorics, Probability and Computing, Cambridge University Press, Cambridge, 1997, 299–304.
P. L. Erdös, A. Seress and L. A. Székely, “Erdös-Ko-Rado and Hilton-Milner type theorems for intersecting chains in posets”, submitted.
P. Frankl, “On intersecting families of finite sets”, J. Combin. Theory, Ser. A, 24, 1978, 146–161.
P. Frankl, “The shifting technique in extremal set theory”, Combinatorial Surveys (C. Whitehead, Ed.), Cambridge Univ. Press, London/New York, 1987, 81–110.
P. Frankl and Z. Füredi, “The Erdös-Ko-Rado theorem for integer sequences”, SIAM J. Alg. Disc. Methods, 1, 1980, 376–381.
Z. Füredi, “Turân type problems”, London Math. Soc. Lecture Note Series, Cambridge Univ. Press, 166, 1991, 253–300.
A. Hajnal and B. Rothschild, “A generalization of the Erdös-Ko-Rado theorem on finite set systems”, J. Combin. Theory Ser. A 15, 1973, 359–362.
A. J. W. Hilton and C. Milner, “Some intersection theorems for systems of finite sets”, Quart. J. Math. Oxford, 2, 18, 1967, 369–384.
W. N. Hsieh, Systems of finite vector spaces, Discrete Mathematics, 2, 1975, 1–16.
M. Simonovits and Vera T. Sós, “Intersection theorems on structures”, Ann. Discrete Math., 6, 1980, 301–313.
M. Simonovits and Vera T. Sós, “Intersection properties of subsets of integers”, European J. Combin., 2, No. 4, 1981, 363–372.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Erdős, P.L., Székely, L.A. (2000). Erdös-Ko-Rado Theorems of Higher Order. In: Althöfer, I., et al. Numbers, Information and Complexity. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-6048-4_11
Download citation
DOI: https://doi.org/10.1007/978-1-4757-6048-4_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4967-7
Online ISBN: 978-1-4757-6048-4
eBook Packages: Springer Book Archive