Ruiling Zheng

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 $I^\pm^{'} (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 t…

math.CO2026

A container theorem for general digraphs with forbidden subdigraphs

Meili Liang, Yue Guan, Ruiling Zheng +1

In a seminal work, KÃ¼hn, Osthus, Townsend, and Zhao used the hypergraph container method to determine the typical structure of oriented graphs and digraphs avoiding a fixed tourna…

A sharp RandiÄ bound for KÃ¶nig--EgervÃ¡ry graphs and a conjecture of Aouchiche, Hansen, and Zheng

A container theorem for general digraphs with forbidden subdigraphs

A sharp RandiÄ bound for KÃ¶nig--EgervÃ¡ry graphs and a conjecture of Aouchiche, Hansen, and Zheng