Title: 3-partite graphs without neither 3-cycles nor 4-cycles

Speaker:  Prof. Mei Lu ( Tsinghua University )

Time: Sat, Dec.26 2020, AM: 09:30-10:30

Location: Tencent Conference

Meeting  Number: 957 629 038

Password: 123456

Inviter: Prof. Hongying Lin

Abstract:

     Let Ck be a cycle of order k, where k≥3. Let ex(n, n, n, {C3, C4}) be the maximum number of edges in a balanced 3-partite graph whose vertex set consists of 3 parts, each has n vertices that has no subgraph isomorphic to C3 or C4. Let p≥5 be a prime number and r≥1 be an integer. In this talk, I will present our result on ex(n, n, n, {C3, C4}). (This work is joint with Zequn Lv and Chunqiu Fang.)