Báo cáo viên: Trần Mạnh Tuấn (ĐH Bách khoa Hà Nội)
Thời gian: 9h30, Thứ 5, ngày 26/09/2019
Địa điểm: Phòng 611- 612, nhà A6, Viện Toán học, 18 Hoàng Quốc Việt.
Tóm tắt: Consider integers k and l such that 0 l kk-1)/2. Given a large graph G, wat is the fraction of k-vertex subsets of G which span exactly l edges? When G is empty or complete, and l is zero or k(k-1)/2, this fraction can be exactly 1. On the other hand if l is not one of these extreme values, then by Ramsey's theorem, this fraction is strictly smaller than 1. The systematic study of the above question was recently initiated by Alon, Hefetz, Krivelevich and Tyomkyn who proposed several natural conjectures. In this talk we present solutions of two of them (one asymptotically) and make first steps towards analogous questions for hypergraphs. Our proofs involve some Ramsey-type arguments, and a number of different probabilistic tools, such as polynomial anti-concentration inequalities, hypercontractivity, and a coupling argument. Joint work with M. Kwan and B. Sudakov. |
