1 citations · 1 across the 20 of their papers we have counts for
7 papers · 2 filters
The asymptotic maximum oriented diameter of graphs
Jiangdong Ai, Yaokun Feng, Hui Lei +1
The oriented diameter of a connected bridgeless graph is the minimum diameter of a strong orientation. Let be the maximum oriented diameter among all such graphs of diameter…
A linear bound for nested cycles without geometric crossings
Jiangdong Ai, Gregory Gutin, Yiming Hao
Cycles in a graph are called nested without geometric crossings if they are pairwise edge-disjoint, , and each pair of conse…
Improved Bounds for Unavoidable Claws in Tournaments
Jiangdong Ai, Yongxin Lan
Let be the largest integer such that every -vertex claw with at most branches occurs in every tournament on vertices, and let $c_{\mathrm{claw}}=\limsup_{n\to…
Finite palette endpoints and degree-square Turán problems
Jiangdong Ai, Bin Chen, Ming Chen +2
We study finite palette extremal problems motivated by uniform Turán densities of -uniform hypergraphs. Given a self-converse tournament with at least two vertices, we deter…
Quasi-kernels in Hereditary Classes and Applications to Break
Jiangdong Ai, Tianyu Huang, Xiangzhou Liu +2
Recently, Nguyen, Seymour and Scott verified the small quasi-kernel conjecture for split digraphs, and initiated the study of quasi-kernels in break digraphs. Following their resea…
A quadratic refinement of Jackson's \CE\ condition for Hamilton cycles in digraphs
Jiangdong Ai, Yongtang Shi
For a digraph , let be the largest size of a vertex set no two of whose vertices lie in a common directed -cycle. Let be the least integer such that eve…
A weighted cycle-localization inequality
Jiangdong Ai, Bin Chen, Ming Chen +1
In 1959, Erdős and Gallai showed that every -connected graph contains a cycle of length at least . This result was subsequently extended to weighte…