»ã±¨±êÌâ (Title)£ºRandom Tur¨¢n problem and Sidorenko conjecture£¨Ëæ»úͼÀ¼ÎÊÌâÓëÎ÷¶àÁ¬¿Æ²Â²â£©

»ã±¨ÈË (Speaker)£º Äô¼Òìä ²©Ê¿ºó£¨¸´µ©´óѧ ÉϺ£ÊýѧÖÐÐÄ£©

»ã±¨¹¦·ò (Time)£º2023Äê9ÔÂ15ÈÕ (ÖÜÎå) 9:30

»ã±¨µØÖ· (Place)£ºÐ£±¾²¿E408

Ô¼ÇëÈË(Inviter)£ºÐ»ÆëÇß

Ö÷°ì²¿ÃÅ£ºÀíѧԺÊýѧϵ

»ã±¨ÌáÒª£ºGiven an r-uniform hypergraph H, the random Tur¨¢n number ex(Grn,p, H) is the maximum number of edges in an H-free subgraph of Grn,p. In the case when H is not r-partite, the problem has been essentially solved independently by Conlon and Gower; and Schacht. In the case when H is r-partite, the degenerate case, not much is known. The Sidorenko conjecture is a notorious problem in extremal combinatorics. It is known that its hypergraph analog is not true. Recently, Conlon, Lee, and Sidorenko discover a relation between Sidorenko conjecture and Turan problem. In this talk, we introduce some recent results on degenerate random Turan problem and its relation to the hypergraph analog of Sidorenko conjecture.