Meili Liang

collaborators

2 papers

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…

math.CO2026

Almost all $C_{k}$ -free oriented graphs have $I^ (n)$ backwards edges

Jianxi Liu, Meili Liang

We prove a conjecture of KÃ¼hn, Osthus, Townsend and Zhao \cite{kuhn2017structure} stating that almost every $C_{k}$ -free oriented graph on $n$ vertices has $I^ (n)$ backwards edges i…

A container theorem for general digraphs with forbidden subdigraphs

Almost all Ck​-free oriented graphs have I^(n) backwards edges

Almost all $C_{k}$ -free oriented graphs have $I^ (n)$ backwards edges