Skip to main content

Counting Intersecting and Pairs of Cross-Intersecting Families


A family of subsets of {1,. . .,n} is called intersecting if any two of its sets intersect. A classical result in extremal combinatorics due to Erdős, Ko and Rado determines the maximum size of an intersecting family of k-subsets of {1,. . .,n}. In this paper we study the following problem: How many intersecting families of k-subsets of {1,. . .,n} are there? Improving a result of Balogh, Das, Delcourt, Liu and Sharifzadeh, we determine this quantity asymptotically for n ≥ 2k+2+2 $\sqrt{k\log k}$ and k → ∞. Moreover, under the same assumptions we also determine asymptotically the number of non-trivial intersecting families, that is, intersecting families for which the intersection of all sets is empty. We obtain analogous results for pairs of cross-intersecting families.

Hide All
[1] Balogh, J., Das, S. A., Delcourt, M., Liu, H. and Sharifzadeh, M. (2015) Intersecting families of discrete structures are typically trivial. J. Combin. Theory Ser. A 132 224245.
[2] Bollobás, B. (1965) On generalized graphs. Acta Math. Acad. Sci. Hungar. 16 447452.
[3] Erdős, P., Ko, C. and Rado, R. (1961) Intersection theorems for systems of finite sets. Quart. J. Math. 12 313320.
[4] Frankl, P. (1987) Erdős–Ko–Rado theorem with conditions on the maximal degree. J. Combin. Theory Ser. A 46 252263.
[5] Frankl, P. and Tokushige, N. (1992) Some best possible inequalities concerning cross-intersecting families. J. Combin. Theory Ser. A 61 8797.
[6] Hilton, A. J. W. (1976) The Erdős–Ko–Rado theorem with valency conditions. Unpublished manuscript.
[7] Hilton, A. J. W. and Milner, E. C. (1967) Some intersection theorems for systems of finite sets. Quart. J. Math. Oxford 18 369384.
[8] Jaeger, F. and Payan, C. (1971) Nombre maximal d'arêtes d'un hypergraphe critique de rang h. CR Acad. Sci. Paris 273 221223.
[9] Katona, G. O. H. (1974) Solution of a problem of A. Ehrenfeucht and J. Mycielski. J. Combin. Theory Ser. A 17 265266.
[10] Katona, G. O. H. (1987) A theorem of finite sets. In Classic Papers in Combinatorics (Gessel, I. and Rota, G.-C., eds), Birkhäuser, pp. 381401.
[11] Kruskal, J. B. (1963) The number of simplices in a complex. In Mathematical Optimization Techniques (Bellman, R., ed.), University of California Press, pp. 251278.
[12] Kupavskii, A. and Zakharov, D. Regular bipartite graphs and intersecting families. Accepted at J. Combin. Theory Ser. A arXiv:1611.03129
[13] Lovász, L. (1979) Combinatorial Problems and Exercises, North-Holland.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *

MSC classification


Full text views

Total number of HTML views: 0
Total number of PDF views: 63 *
Loading metrics...

Abstract views

Total abstract views: 245 *
Loading metrics...

* Views captured on Cambridge Core between 16th October 2017 - 17th August 2018. This data will be updated every 24 hours.