Spectral Tur\'an problem for K3,3--free signed graphs
Abstract
The classical spectral Tur\'an problem is to determine the maximum spectral radius of an F-free graph of order n. Zhai and Wang [Linear Algebra Appl, 437 (2012) 1641-1647] determined the maximum spectral radius of C4-free graphs of given order. Additionally, Nikiforov obtained spectral strengthenings of the Kovari-S\'os-Tur\'an theorem [Linear Algebra Appl, 432 (2010) 1405-1411] when the forbidden graphs are complete bipartite. The spectral Tur\'an problem concerning forbidden complete bipartite graphs in signed graphs has also attracted considerable attention. Let Ks,t- be the set of all unbalanced signed graphs with underlying graphs Ks,t. Since the cases where s=1 or t=1 do not conform to the definition of Ks,t-, it follows that s,t≥ 2. Wang and Lin [Discrete Appl. Math, 372 (2025) 164-172] have solved the case of s=t=2 since K2,2- is C4- in this situation. This paper gives an answer for s=t=3 and completely characterizes the corresponding extremal signed graphs.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.