2 citations · 2 across the 2 of their papers we have counts for
3 papers
math.CO2025
Turán number of books in non-bipartite graphs
Lu Miao, Ruifang Liu, Edwin R. van Dam
Let be the Turán number of for a given graph . A graph is color-critical if it contains an edge whose removal reduces its chromatic number. Simonovits' c…
math.CO2025★ 2 cited
Spectral Turán problem of non-bipartite graphs: Forbidden books
Ruifang Liu, Lu Miao
A book graph is a set of triangles with a common edge, where is an integer. Zhai and Lin [J. Graph Theory 102 (2023) 502-520] proved that for $n\geq\frac{1…
math.CO2022
Maxima of the -index of non-bipartite -free graphs
Ruifang Liu, Lu Miao, Jie Xue
A classic result in extremal graph theory, known as Mantel's theorem, states that every non-bipartite graph of order with size contains a tri…