Book contents
- Frontmatter
- Contents
- List of Contributors
- Preface
- 1 Probabilizing Fibonacci Numbers
- 2 On the Number of ON Cells in Cellular Automata
- 3 Search for Ultraflat Polynomials with Plus and Minus One Coefficients
- 4 Generalized Gončarov Polynomials
- 5 The Digraph Drop Polynomial
- 6 Unramified Graph Covers of Finite Degree
- 7 The First Function and Its Iterates
- 8 Erdős, Klarner, and the 3x + 1 Problem
- 9 A Short Proof for an Extension of the Erdős–Ko–Rado Theorem
- 10 The Haight–Ruzsa Method for Sets with More Differences than Multiple Sums
- 11 Dimension and Cut Vertices: An Application of Ramsey Theory
- 12 Recent Results on Partition Regularity of Infinite Matrices
- 13 Some Remarks on π
- 14 Ramsey Classes with Closure Operations (Selected Combinatorial Applications)
- 15 Borsuk and Ramsey Type Questions in Euclidean Space
- 16 Pick's Theorem and Sums of Lattice Points
- 17 Apollonian Ring Packings
- 18 Juggling and Card Shuffling Meet Mathematical Fonts
- 19 Randomly Juggling Backwards
- 20 Explicit Error Bounds for Lattice Edgeworth Expansions
- References
9 - A Short Proof for an Extension of the Erdős–Ko–Rado Theorem
Published online by Cambridge University Press: 25 May 2018
Book contents
- Frontmatter
- Contents
- List of Contributors
- Preface
- 1 Probabilizing Fibonacci Numbers
- 2 On the Number of ON Cells in Cellular Automata
- 3 Search for Ultraflat Polynomials with Plus and Minus One Coefficients
- 4 Generalized Gončarov Polynomials
- 5 The Digraph Drop Polynomial
- 6 Unramified Graph Covers of Finite Degree
- 7 The First Function and Its Iterates
- 8 Erdős, Klarner, and the 3x + 1 Problem
- 9 A Short Proof for an Extension of the Erdős–Ko–Rado Theorem
- 10 The Haight–Ruzsa Method for Sets with More Differences than Multiple Sums
- 11 Dimension and Cut Vertices: An Application of Ramsey Theory
- 12 Recent Results on Partition Regularity of Infinite Matrices
- 13 Some Remarks on π
- 14 Ramsey Classes with Closure Operations (Selected Combinatorial Applications)
- 15 Borsuk and Ramsey Type Questions in Euclidean Space
- 16 Pick's Theorem and Sums of Lattice Points
- 17 Apollonian Ring Packings
- 18 Juggling and Card Shuffling Meet Mathematical Fonts
- 19 Randomly Juggling Backwards
- 20 Explicit Error Bounds for Lattice Edgeworth Expansions
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Connections in Discrete MathematicsA Celebration of the Work of Ron Graham, pp. 169 - 172Publisher: Cambridge University PressPrint publication year: 2018
References
2. , , and . Intersection theorems for systems of finite sets. Quart. J. Math. 12 (1961) N1, 313–320.Google Scholar
3. and . Old and new proofs of the Erdos-Ko-Rado theorem. Sichuan Daxue Xuebao 26 (1989), 112–122.Google Scholar
4. and . Erdős-Ko-Rado theorem for ﹛0,±1﹜-vectors. JCTA, forthcoming. arXiv:1510.03912
5. and . Families of finite sets with minimum shadows. Combinatorica 6 (1986), 355–363.Google Scholar
6. . The Erdos-Ko-Rado theorem with valency conditions. (1976), unpublished manuscript.
7. . A theorem of finite sets. In “Theory of Graphs, Proc. Coll. Tihany, 1966.” Akad, Kiado, Budapest, 1968; Classic Papers in Combinatorics (1987), 381–401.
9. and . The exact bound in the Erdos-Ko-Rado theorem for cross-intersecting families. J. Combin. Theory Ser. A 52 (1989) N1, 90–97.Google Scholar
10. . A new generalization of the Erdős-Ko-Rado theorem. J. Combin. Theory Ser. A 43 (1986), 85–90.Google Scholar
- 2
- Cited by