Fankang He

collaborators

4 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 $I ¨ : E (K_{2 n}) \to {- 1, + 1}$ admits a high discrepancy $1$ -factor deco…

math.CO2024

A complete characterization of split digraphs with a strong arc decomposition

Jiangdong Ai, Fankang He, Zhaoxiang Li +2

A \textbf{strong arc decomposition} of a (multi-)digraph $D (V, A)$ is a partition of its arc set $A$ into two disjoint arc sets $A_{1}$ and $A_{2}$ such that both of the spanning subdi…

math.CO2024

On degree power sum in $P_{k}$ -free graphs

Jiangdong Ai, Fankang He, Yihang Liu +1

Let $G$ be a graph on $n$ vertices with degree sequence $(d_{1}, d_{2} ...... d_{n})$ . For a real $p \geq 1$ , let $D_{p} (G) = \sum_{i = 1}^{n} d_{i}^{p}$ . A TurÃ¡n-type problem of degree power sum was i…

Note on Long Directed Cycles in Eulerian Digraphs

On high discrepancy 1-factorizations of complete graphs

A complete characterization of split digraphs with a strong arc decomposition

On degree power sum in Pk​-free graphs

On high discrepancy $1$ -factorizations of complete graphs

On degree power sum in $P_{k}$ -free graphs