F. Nan

collaborators

2 papers

math.CO2026

A sharp Randić bound for König--Egerváry graphs and a conjecture of Aouchiche, Hansen, and Zheng

Pei Liu, Feiyu Nan, Suil O +1

Let $α^{'} (G)$ be the matching number of a graph $G$ , and let its Randić index be $R (G) = \sum_{uv \in E (G)} (d (u) d (v))^{- 1/2}$ . In 2006, Aouchiche, Hansen, and Zheng conjectured that the…

math.CO2025

Majority Edge Colouring of Hypergraph

Jiangdong Ai, Feiyu Nan

Motivated by recent work on majority edge-colourings of graphs, we initiate the study of the corresponding problem for hypergraphs. First, sharpening the probabilistic argument by…