Yisai Xue

activity

20242026

collaborators

11 papers

math.CO2026

Minimum degree stability for graphs without odd-cycle blow-up

Yisai Xue

For fixed integers $g \geq 2$ and $t \geq 1$ , and every $ε > 0$ , we prove that there exists a constant $I ¨ > 0$ such that every $n$ -vertex graph $G$ with $Î´(G)\ge (2/(2g+1)+\var…

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 $I ¨ : 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 bou…

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

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

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$ . F…