Jian Wang

activity

20242026

collaborators

10 papers

math.CO2026

On the chromatic profile for tripartite graphs and beyond

Bo Ning, Jian Wang, Yisai Xue

Let $H$ be a graph and let $I^´_{I ¨} (H, r)$ denote the infimum of $c$ such that every $H$ -free graph with minimum degree at least $c n$ is $r$ -colorable. The \textit{chromatic profile}…

math.CO2026

Nearly ErdÅs-Ko-Rado theorems

Gyula O. H. Katona, Jian Wang

If a family $F$ of $k$ -element subsets of an $n$ -element set is pairwise intersecting, $2 k \leq n$ then $∣ F ∣ \leq (k - 1 n - 1)$ holds by the celebrated ErdÅs…

math.CO2026

A note on the maximum diversity of intersecting families in the symmetric group

Jian Wang, Jimeng Xiao

Let $S_{n}$ be the symmetric group on the set $[n] := {1, 2, \dots, n}$ . A family $F \subset S_{n}$ is called intersecting if for every $Ï,Ï\in \mathcal{F}…

math.CO2025

Andr{Ã¡}sfai--ErdÅs--SÃ³s theorem under max-degree constraints

Xizhi Liu, Sijie Ren, Jian Wang

We establish the following strengthening of the celebrated Andr{Ã¡}sfai--ErdÅs--SÃ³s theorem: If $G$ is an $n$ -vertex $K_{r + 1}$ -free graph whose minimum degree $I^´ (G)$ and maximum…

math.CO2025

Extremal triangle-free graphs with chromatic number at least four

Sijie Ren, Jian Wang, Shipeng Wang +1

Let $G$ be an $n$ -vertex triangle-free graph. The celebrated Mantel's theorem showed that $e (G) \leq ⌊ \frac{n ^{2}}{4} ⌋$ . In 1962, ErdÅs (together with Gallai), and indepe…

math.CO2025

Hypergraph TurÃ¡n problem of the generalized triangle with bounded matching number

Jian Wang, Wenbin Wang, Weihua Yang

Let $H$ be a 3-graph on $n$ vertices. The matching number $I^½ (H)$ is defined as the maximum number of disjoint edges in $H$ . The generalized triangle…

On the chromatic profile for tripartite graphs and beyond

Nearly ErdÅs-Ko-Rado theorems

A note on the maximum diversity of intersecting families in the symmetric group

Andr{Ã¡}sfai--ErdÅs--SÃ³s theorem under max-degree constraints

Extremal triangle-free graphs with chromatic number at least four

Hypergraph TurÃ¡n problem of the generalized triangle with bounded matching number

Nearly ErdÅs-Ko-Rado theorems

Andr{Ã¡}sfai--ErdÅs--SÃ³s theorem under max-degree constraints