1. Intersecting families of discrete structures are typically trivial;Balogh;J. Combin. Theory Ser. A,2015
2. J. Balogh, B. Narayanan, J. Skokan, The number of hypergraphs without linear cycles, ArXiv e-prints, June 2017, available at arXiv:1706.01207.
3. B. Bollobás, Hereditary properties of graphs: asymptotic enumeration, global structure, and colouring, in: Proceedings of the International Congress of Mathematicians, Vol. III (Berlin, 1998), 1998, pp. 333–342. MR1648167.
4. Asymptotic Enumeration of Kn-Free Graphs;Erdős,1976
5. P. Frankl, A. Kupavskii, Counting intersecting and pairs of cross-intersecting families, ArXiv e-prints, Jan. 2017, available at arXiv:1701.04110.