Fuhong Ma

activity

20172026

most citedFlexibility of Planar Graphs -- Sharpening the Tools to Get Lists of Size Four

5 citations · 8 across the 7 of their papers we have counts for

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2026

A note on zero-sum Ramsey numbers of complete graphs

Cheng Chi, Jialin He, Fuhong Ma

For a graph $H$ with $3 ∣ e (H)$ , the zero-sum Ramsey number $R (H, Z_{3})$ is the least integer $N$ such that every labeling of the edges of $K_{N}$ by elements of $Z_{3}$ contains a c…

math.CO2022

The minimum number of clique-saturating edges

Jialin He, Fuhong Ma, Jie Ma +1

Let $G$ be a $K_{p}$ -free graph. We say $e$ is a $K_{p}$ -saturating edge of $G$ if $e \in / E (G)$ and $G + e$ contains a copy of $K_{p}$ . Denote by $f_{p} (n, e)$ the minimum number of $K_{p}$ -…

math.CO2020

Defective DP-colorings of sparse simple graphs

Yifan Jing, Alexandr Kostochka, Fuhong Ma +1

DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvořák and Postle. We introduce and study $(i, j)$ -defective DP-colori…

math.CO2019★ 2 cited

Defective DP-colorings of sparse multigraphs

Yifan Jing, Alexandr Kostochka, Fuhong Ma +2

DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvorak and Postle. We introduce and study $(i, j)$ -defective DP-colori…

math.CO2017★ 1 cited

The confirmation of a conjecture on disjoint cycles in a graph

Fuhong Ma, Jin Yan

In this paper, we prove the following conjecture proposed by Gould, Hirohata and Keller [Discrete Math. submitted]: Let $G$ be a graph of sufficiently large order. If $σ_t(G) \geq…

math.CO2017

Lichiardopol's conjecture on disjoint cycles in tournaments

Fuhong Ma, Douglas B. West, Jin Yan

In 2010, N. Lichiardopol conjectured for $q \geq 3$ and $k \geq 1$ that any tournament with minimum out-degree at least $(q - 1) k - 1$ contains $k$ disjoint cycles of length $q$ . We pr…