works on
directed graphs 1extremal combinatorics 1hypergraphs 1oriented graphs 1palette extremal problems 1planar graphs 1second neighbourhood conjecture 1split graphs 1triangle-free graphs 1turan problems 1

From the 2 of 13 linked papers with an AI index.

activity
20242026
collaborators
Showing cs.DMShow all

1 paper · 1 filter

cs.DM2026

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…