Lu Miao

collaborators

2 papers

math.CO2025

TurÃ¡n number of books in non-bipartite graphs

Lu Miao, Ruifang Liu, Edwin R. van Dam

Let $ex (n, H)$ be the TurÃ¡n number of $H$ for a given graph $H$ . A graph is color-critical if it contains an edge whose removal reduces its chromatic number. Simonovits'…

math.CO2025

Spectral TurÃ¡n problem of non-bipartite graphs: Forbidden books

Ruifang Liu, Lu Miao

A book graph $B_{r + 1}$ is a set of $r + 1$ triangles with a common edge, where $r \geq 0$ is an integer. Zhai and Lin [J. Graph Theory 102 (2023) 502-520] proved that for $n\geq\frac{1…