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

Showing 2026Show all

5 papers · 1 filter

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…

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

Polynomial minimum degree stability for $3$ -chromatic graphs