Zilong Yan

works on

directed graphs 1 extremal combinatorics 1 hypergraphs 1 palette extremal problems 1 turan problems 1

From the 1 of 4 linked papers with an AI index.

collaborators

4 papers

math.CO2026

Finite palette endpoints and degree-square TurÃ¡n problems

Jiangdong Ai, Bin Chen, Ming Chen +2

The paper investigates extremal color‑palette problems motivated by uniform Turán densities of 3‑uniform hypergraphs, showing they reduce to maximizing the sum of squared out‑degre…

math.CO2024

Chromatic profiles of odd cycles

Zilong Yan, Yuejian Peng, Xiaoli Yuan

ErdÅs and Simonovits asked the following question: For an integer $c \geq 2$ and a family of non-bipartite graphs $F$ , what is the infimum of $I^\pm$ such that any $\mathcal…

math.CO2024

Intersecting families with full difference sets

Yan zilong, Peng Yuejian

For a family $F$ of subsets of a finite set, define $D (F) = {F ∖ F^{'} : F, F^{'} \in F}$ . A family $F$ is called intersecting if $F…

math.CO2024

A strong structural stability of $C_{2 k + 1}$ -free graphs

Zilong Yan, Yuejian Peng

FÃ¼redi and Gunderson showed that $e x (n, C_{2 k + 1})$ is achieved only on $K_{⌊ \frac{n}{2} ⌋, ⌈ \frac{n}{2} ⌉}$ if $n \geq 4 k - 2$ . It is natural to study how far a $…

Finite palette endpoints and degree-square TurÃ¡n problems

Chromatic profiles of odd cycles

Intersecting families with full difference sets

A strong structural stability of C2k+1​-free graphs

A strong structural stability of $C_{2 k + 1}$ -free graphs