Fankang He

collaborators

2 papers

math.CO2025

Note on Long Directed Cycles in Eulerian Digraphs

Jiangdong Ai, Gregory Gutin, Fankang He +1

Huang, Ma, Shapira, Sudakov and Yuster (Comb. Prob. Comput. 2013) proved that every Eulerian digraph of average out-degree $d$ has a directed cycle of length at least $d .$ W…

math.CO2025

On high discrepancy $1$ -factorizations of complete graphs

Jiangdong Ai, Fankang He, Seonghyuk Im +1

We proved that for every sufficiently large $n$ , the complete graph $K_{2 n}$ with an arbitrary edge signing $σ : E (K_{2 n}) \to {- 1, + 1}$ admits a high discrepancy $1$ -factor decom…

Note on Long Directed Cycles in Eulerian Digraphs

On high discrepancy 1-factorizations of complete graphs

On high discrepancy $1$ -factorizations of complete graphs