Leírás
10:00-10:30 Shenggui Zhang：Properly colored cycles in edge-colored balanced bipartite graph
10:30-11:00 Nagy Dániel: Maximum subgraph densities in graphs with given size and order
if there is coffee, there will be coffe break
11:30-12:00 Ligong Wang：Extremal spectral radius of graphs without linear forests or star forests
12:00-12:30 Győri Ervin: Subgraph densities in $K_r$-free graphs
12:30-13:00 Binlong Li: The Turán number of directed paths and oriented cycles
Lunch
14:00-14:30 Bérczi Kristóf: Packings and coverings by rainbow forests
14:30-15:00 Xiaogang Liu：Fractional revival on Cayley graphs over abelian groups
15:30-15:30 Gerbner Dániel: Generalized Turán results for disjoint cliques
there will be coffee
16:00-16:30 You Lu: Integer flows in signed graphs
16:30-17:00 Patkós Balázs: On the number of maximal independent sets: From Moon-Moser to Hujter-Tuza