3 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 be the matching number of a graph , and let its Randić index be . In 2006, Aouchiche, Hansen, and Zheng conjectured that the…
math.CO2026
The typical structure of oriented graphs and digraphs with forbidden blow-up of transitive tournaments
Meili Liang, Yue Guan, Ruiling Zheng +1
For integers \(r\ge 2\), \(t\ge 1\) and a real number \(a\in(3/2,2]\), we study the typical structure of oriented graphs and digraphs that do not contain a blow-up \(T_{r+1}^t\) of…
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 tournam…