Sijie Ren

collaborators

4 papers

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.CO2024

Positive codegree AndrÃ¡sfai--ErdÅs--SÃ³s theorem for the generalized triangle

Xizhi Liu, Sijie Ren, Jian Wang

The celebrated AndrÃ¡sfai--ErdÅs--SÃ³s Theorem from 1974 shows that every $n$ -vertex triangle-free graph with minimum degree greater than $2 n /5$ must be bipartite. We establish a…

math.CO2024

AndrÃ¡sfai--ErdÅs--SÃ³s theorem for the generalized triangle

Xizhi Liu, Sijie Ren, Jian Wang

The celebrated AndrÃ¡sfai--ErdÅs--SÃ³s Theorem from 1974 shows that every $n$ -vertex triangle-free graph with minimum degree greater than $2 n /5$ must be bipartite. Its extensions…

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

Extremal triangle-free graphs with chromatic number at least four

Positive codegree AndrÃ¡sfai--ErdÅs--SÃ³s theorem for the generalized triangle

AndrÃ¡sfai--ErdÅs--SÃ³s theorem for the generalized triangle

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

Positive codegree AndrÃ¡sfai--ErdÅs--SÃ³s theorem for the generalized triangle

AndrÃ¡sfai--ErdÅs--SÃ³s theorem for the generalized triangle