On the stability of the Erdős-Ko-Rado theorem

Journal of Combinatorial Theory. Series A

Volumn 137, Issue , 2016, Pages 64-78

  Bollobás, Béla ^a,b,c   Narayanan, Bhargav P ^a   Raigorodskii, Andrei M ^d,e  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b University of Memphis   (United States)

^c LONDON INSTITUTE FOR MATHEMATICAL SCIENCES   (United Kingdom)

^d MOSCOW STATE UNIVERSITY   (Russian Federation)

^e MOSCOW INSTITUTE OF PHYSICS AND TECHNOLOGY   (Russian Federation)

Author keywords

Intersecting families; Random graphs; Stability; Transference

Indexed keywords

EID: 84941236753     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/j.jcta.2015.08.002     Document Type: Article

References (28)

1. Babai L., Simonovits M., Spencer J. Extremal subgraphs of random graphs. J. Graph Theory 1990, 14:599-622.
2. Balogh J., Bohman T., Mubayi D. Erdos-Ko-Rado in random hypergraphs. Combin. Probab. Comput. 2009, 18:629-646.
3. Balogh J., Morris R., Samotij W. Independent sets in hypergraphs preprint. arxiv:1204.6530.
4. Balogh J., Morris R., Samotij W. Random sum-free subsets of Abelian groups. Israel J. Math. 2015, in press.
5. Bogolyubskiy L.I., Gusev A.S., Pyaderkin M.M., Raigorodskii A.M. The independence numbers and the chromatic numbers of random subgraphs of some distance graphs. Dokl. Math. 2014, 457:383-387.
6. Bogolyubskiy L.I., Gusev A.S., Pyaderkin M.M., Raigorodskii A.M. The independence numbers and the chromatic numbers of random subgraphs of some distance graphs. Mat. Sb. 2015, in press.
7. Brightwell G., Panagiotou K., Steger A. Extremal subgraphs of random graphs. Random Structures Algorithms 2012, 41:147-178.
8. Bushaw N., Collares Neto M., Morris R., Smith P. The sharp threshold for maximum size sum-free subsets in even-order Abelian groups. Combin. Probab. Comput. 2015, in press.
9. D. Conlon, T. Gowers, Combinatorial theorems in sparse random sets, submitted for publication.
10. DeMarco B., Kahn J. Mantel's theorem for random graphs preprint. arxiv:1206.1016.
11. Diananda P.H., Yap H.P. Maximal sum-free sets of elements of finite groups. Proc. Jpn. Acad. 1969, 45:1-5.
12. Dinur I., Friedgut E. Intersecting families are essentially contained in juntas. Combin. Probab. Comput. 2009, 18:107-122.
13. Erdos P., Ko C., Rado R. Intersection theorems for systems of finite sets. Q. J. Math. 1961, 12:313-320.
14. Friedgut E. On the measure of intersecting families, uniqueness and stability. Combinatorica 2008, 28:503-528.
15. Friedgut E., Rödl V., Schacht M. Ramsey properties of random discrete structures. Random Structures Algorithms 2010, 37:407-436.
16. Green B., Tao T. The primes contain arbitrarily long arithmetic progressions. Ann. of Math. 2008, 167:481-547.
17. Hilton A.J.W., Milner E.C. Some intersection theorems for systems of finite sets. Q. J. Math. 1967, 18:369-384.
18. Keevash P., Mubayi D. Set systems without a simplex or a cluster. Combinatorica 2010, 30:175-200.
19. Kohayakawa Y., Łuczak T., Rödl V. Arithmetic progressions of length three in subsets of a random set. Acta Arith. 1996, 75:133-163.
20. Kohayakawa Y., Schacht M., Spöhel R. Upper bounds on probability thresholds for asymmetric Ramsey properties. Random Structures Algorithms 2014, 44:1-28.
21. Łuczak T. Randomness and regularity. International Congress of Mathematicians, vol. III 2006, 899-909. Eur. Math. Soc., Zürich.
22. Rödl V., Ruciński A. Threshold functions for Ramsey properties. J. Amer. Math. Soc. 1995, 8:917-942.
23. Rödl V., Ruciński A. Rado partition theorem for random subsets of integers. Proc. Lond. Math. Soc. 1997, 74:481-502.
24. Rödl V., Ruciński A. Ramsey properties of random hypergraphs. J. Combin. Theory Ser. A 1998, 81:1-33.
25. Rödl V., Schacht M. Extremal results in random graphs preprint. arxiv:1302.2248.
26. Roth K.F. On certain sets of integers. J. Lond. Math. Soc. 1953, 28:104-109.
27. Saxton D., Thomason A. Hypergraph containers preprint. arxiv:1204.6595.
28. M. Schacht, Extremal results for random discrete structures, submitted for publication.