A Unique Characterization of Spectral Extrema for Friendship Graphs

Turán-type problem is one of central problems in extremal graph theory. Erdős et al. [J. Combin. Theory Ser. B 64 (1995) 89-100] obtained the exact Turán number of the friendship graph $F_k$ for $n\geq 50k^2$, and characterized all its extremal graphs. Cioabă et al. [Electron. J. Combin. 27 (2020) P...

Full description

Saved in:
Bibliographic Details
Published inThe Electronic journal of combinatorics Vol. 29; no. 3
Main Authors Zhai, Mingqing, Liu, Ruifang, Xue, Jie
Format Journal Article
LanguageEnglish
Published 12.08.2022
Online AccessGet full text

Cover

Loading…