Skip to content

Author

Yao-Jun Chen

We have 7 of 30 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

An asymptotically tight bound on oriented diameter

Let $f(d)$ be the smallest integer such that every connected bridgeless graph of diameter $d$ admits an orientation with directed diameter at most $f(d)$. Chv\'atal and Thomassen (1978) proved $\left\lceil{d^2}/{2}\right\rceil+d\le f(d) \le 2d^2+2d$. In this paper, we prove that $f(d)\le \left\lceil d^2/2\right\rceil+6...

Jiang-Dong Ai, Yao-Jun Chen, Yao-Kun Feng et al. · 0 citations
Preprint Sep 2026

Ramsey multiplicity and extremal colorings for odd cycles

The Ramsey number $r(H)$ of a graph $H$ is the minimum positive integer $N$ such that every red/blue edge-coloring of the complete graph $K_N$ on $N$ vertices contains a monochromatic copy of $H$. The Ramsey multiplicity $M(H,n)$ is the minimum number of monochromatic copies of $H$ over all red/blue edge-colorings of $...

Ting Huang, Jun-Ying Lu, Jia-Bao Yang et al. · 0 citations
Preprint Oct 2026

Degree-square Tur\'an problem for two self-converse tournaments

For a fixed digraph $F$, let $\operatorname{ex}_2^+(n,F)$ be the maximum of $\sum_{v\in V(D)}d_D^+(v)^2$ over all $n$-vertex $F$-free digraphs. Ai et al. [arXiv:2606.03520, 2026] asked for which self-converse tournament $F$ one can determine $\operatorname{ex}_2^+(n,F)$. Let $TT_r$ denote a transitive tournament on $r$...

Zhuo-Ran Han, Yao-Jun Chen · 0 citations
Preprint Sep 2026

Nonregular graphs of odd maximum degree with maximum spectral radius

Let $\rho(n,d)$ denote the maximum adjacency spectral radius among all connected nonregular graphs of order $n$ and maximum degree $d$. A graph attaining this maximum is called an extremal graph. Liu [J. Combin. Theory Ser. B, 2024] determined the extremal graphs for $d=3,4$ and formulated two conjectures for general $...

Liang-Dong Fan, Li-Ying Kang, Yao-Jun Chen · 0 citations
Preprint Sep 2026

Counterexamples to two conjectures on the diameter of clique-free graphs

Erd\H{o}s et al. (JCT-B, 1989) conjectured that, for integers $r\ge 2$ and $\delta\ge 2$ with $3r-1\mid\delta$, every connected $K_{2r+1}$-free graph of order $n$ and minimum degree $\delta$ has diameter at most $ \frac{3r-1}{r}\cdot \frac{n}{\delta}+O(1)$. Czabarka et al. (JCT-B, 2021) later proposed the following gen...

Hang Chen, Yao-Jun Chen · 0 citations
Preprint Sep 2026

A near-linear upper bound for Burr's conjecture

Let $f(k)$ denote the smallest integer such that every oriented graph $D$ with chromatic number at least $f(k)$ contains every oriented tree on $k$ vertices. Burr (1980) showed that $f(k)\le (k-1)^2$ and conjectured that $f(k)=2k-2$. Bessy, Gon\c{c}alves and Reinald (2025) proved that $f(k)=O(k^{3/2})$. In this paper,...

Liang-Dong Fan, Jun-Ying Lu, Yao-Jun Chen · 0 citations
Preprint Aug 2026

New upper bound for the Ramsey number of odd cycles

The \emph{$k$-color Ramsey number} $R_k(C_{2\ell+1})$ is the least integer $n$ such that any $k$-edge-coloring of a complete graph $K_n$ has a monochromatic odd cycle $C_{2\ell+1}$. Axenovich, Cames van Batenburg, Janzer, Michel, and Rundstr\"om~(JCT-B, 2026) recently proved \[ R_k(C_{2\ell+1})\le (4\ell-2)^k k^{k/\ell...

Ting Huang, Jia-Bao Yang, Yao-Jun Chen · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.