Yisai Xue

activity

20212026

most citedAnti-Ramsey number of matchings in

r

-partite

r

-uniform hypergraphs

1 citations · 1 across the 12 of their papers we have counts for

collaborators

14 papers

math.CO2026

Polynomial minimum degree stability for $3$ -chromatic graphs

Yisai Xue

Let $H$ be a fixed 3-chromatic graph, and let $g \geq 2$ be the smallest integer such that there is no homomorphism $H \to C_{2 g + 1}$ . For every $ε > 0$ , we prove t…

math.CO2026

Abundance of Unique Subhypergraphs

Xichao Shu, Zhuo Wu, Yisai Xue

Given $k$ -uniform hypergraphs $G$ and $H$ , we say that $G$ is a unique subhypergraph of $H$ if $H$ contains exactly one subhypergraph isomorphic to $G$ . For an $n$ -vertex $k$ -graph…

math.CO2026

A discrepancy dichotomy for 1-factorizations of signed complete bipartite graphs

Yisai Xue, Yacong Zhou

Given a signing $σ : E (K_{n, n}) \to {- 1, + 1}$ of the complete bipartite graph, when does $K_{n, n}$ admit a $1$ -factorization in which every perfect matching has discrepancy boun…

math.CO2026

On the chromatic profile for tripartite graphs and beyond

Bo Ning, Jian Wang, Yisai Xue

Let $H$ be a graph and let $δ_{χ} (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} of…

math.CO2026

Chromatic thresholds for pairs of graphs

Jun Gao, Hong Liu, Zhuo Wu +1

The chromatic threshold of a graph $H$ is the minimum-degree density above which every $H$ -free graph has bounded chromatic number. We study a two-color Ramsey analogue: for graphs…

math.CO2025

Edge density and minimum degree thresholds for $H$ -free graphs with unbounded chromatic number

Zhuo Wu, Yisai Xue

The chromatic threshold $δ_{χ} (H)$ of a graph $H$ is the infimum of $d > 0$ such that the chromatic number of every $n$ -vertex $H$ -free graph with minimum degree at least $d n$ is bound…

math.CO2025

A directed Andrásfai-Erdős-Sós theorem and chromatic profiles of oriented cycles

Yisai Xue

The chromatic profile of a digraph $H$ , denoted by $δ_{χ}^{+} (H, k)$ , is the infimum $d$ such that any $H$ -free digraph $D$ on $n$ vertices with minimum out-degree $δ^{+} (D) \geq d n$ m…

math.CO2025

Stability with minuscule structure for chromatic thresholds

Jaehoon Kim, Hong Liu, Chong Shangguan +3

The chromatic threshold $δ_{χ} (H)$ of a graph $H$ is the infimum of $d > 0$ such that the chromatic number of every $n$ -vertex $H$ -free graph with minimum degree at least $d n$ is boun…

math.CO2025

On generalized Tur{á}n problems with bounded matching number and circumference

Yongchun Lu, Liying Kang, Yisai Xue

Let $ \mathcal{F} $ be a family of graphs. The generalized Turán number $ \operatorname{ex}(n, K_r, \mathcal{F}) $ is the maximum number of $K_{r}$ in an $ n $-vertex graph tha…

math.CO2024

On generalized Turán problems with bounded matching number

Yisai Xue, Liying Kang

The generalized Turán number $ex (n, H, F)$ is defined as the maximum number of copies of a graph $H$ in an $n$ -vertex graph that does not contain any graph $F \i…

math.CO2023

Counting cliques without generalized theta graphs

Jun Gao, Zhuo Wu, Yisai Xue

The \textit{generalized Turán number} $ex (n, T, F)$ is the maximum possible number of copies of $T$ in an $F$ -free graph on $n$ vertices for any two graphs $T$ and $F$ . Fo…

math.CO2022

Stability of generalized Turán number for linear forests

Yisai Xue, Yichong Liu, Liying Kang

Given a graph $T$ and a family of graphs $F$ , the generalized Turán number of $F$ is the maximum number of copies of $T$ in an $F$ -free graph on $n$ v…

math.CO2022

On a conjecture of spectral extremal problems

Jing Wang, Liying Kang, Yusai Xue

For a simple graph $F$ , let $Ex (n, F)$ and $E x_{sp} (n, F)$ denote the set of graphs with the maximum number of edges and the set of graphs with the maximum spectra…

math.CO2021★ 1 cited

Anti-Ramsey number of matchings in $r$ -partite $r$ -uniform hypergraphs

Yisai Xue, Erfang Shan, Liying Kang

An edge-colored hypergraph is rainbow if all of its edges have different colors. Given two hypergraphs $H$ and $G$ , the anti-Ramsey number $ar(\mathcal{G}, \mat…

Polynomial minimum degree stability for 3-chromatic graphs

Abundance of Unique Subhypergraphs

A discrepancy dichotomy for 1-factorizations of signed complete bipartite graphs

On the chromatic profile for tripartite graphs and beyond

Chromatic thresholds for pairs of graphs

Edge density and minimum degree thresholds for H-free graphs with unbounded chromatic number

A directed Andrásfai-Erdős-Sós theorem and chromatic profiles of oriented cycles

Stability with minuscule structure for chromatic thresholds

On generalized Tur{á}n problems with bounded matching number and circumference

On generalized Turán problems with bounded matching number

Counting cliques without generalized theta graphs

Stability of generalized Turán number for linear forests

On a conjecture of spectral extremal problems

Anti-Ramsey number of matchings in r-partite r-uniform hypergraphs

Polynomial minimum degree stability for $3$ -chromatic graphs

Edge density and minimum degree thresholds for $H$ -free graphs with unbounded chromatic number

Anti-Ramsey number of matchings in $r$ -partite $r$ -uniform hypergraphs