O. Suil

works on

edge-color-critical graphs 1 multipartite classification 1 non-r-partite graphs 1 spectral extremal graph theory 1 Turán graphs 1

From the 1 of 3 linked papers with an AI index.

collaborators

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 $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 reduction principle for non- $r$ -partite spectral extremal problems, with a complete multipartite classification

Suil O, Jiadong Wu

The paper proves a reduction principle that converts spectral extremal problems for non‑r‑partite, edge‑color‑critical forbidden graphs into edge‑counting problems, and uses it to…

math.CO2026

Extremal eigenvalues of combinatorial Hodge Laplacians

Zhen Chen, Suil O, Jianfeng Wang

For a finite simplicial complex on $[n]$ , the combinatorial Hodge Laplacian splits as $L_{k} = L_{k}^{up} + L_{k}^{down}$ , and Duval and Reiner showed that $λ_{\max}(L_k^{\…

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

A reduction principle for non-r-partite spectral extremal problems, with a complete multipartite classification

Extremal eigenvalues of combinatorial Hodge Laplacians

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

A reduction principle for non- $r$ -partite spectral extremal problems, with a complete multipartite classification