1 citations · 1 across the 20 of their papers we have counts for
24 papers
Derived Picard reconstruction for graded surfaces with stops
Wen Chang, Dongjian Wu
We study reconstruction of graded surfaces with stops from their mapping class groups and the derived Picard groups of their partially wrapped Fukaya categories. In genus…
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…
The Complexity of Mixed Arc-Disjoint Spanning Subdigraphs with Antistrong Connectivity
Jiangdong Ai, Gregory Gutin, Hui Lei +1
A trail is antidirected if its arcs alternate between forward and backward. A digraph is antistrong if, for every ordered pair of distinct vertices , it contains a…
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…