English

Tur\'{a}n problem for $\mathcal{K}_4^-$-free signed graphs

Combinatorics 2023-06-13 v1

Abstract

Suppose that G˙\dot{G} is an unbalanced signed graph of order nn with e(G˙)e(\dot{G}) edges. Let ρ(G˙)\rho(\dot{G}) be the spectral radius of G˙\dot{G}, and K4\mathcal{K}_4^- be the set of the unbalanced K4K_4. In this paper, we prove that if G˙\dot{G} is a K4\mathcal{K}_4^--free unbalanced signed graph of order nn, then e(G˙)n(n1)2(n3)e(\dot{G})\leqslant \frac{n(n-1)}{2}-(n-3) and ρ(G˙)n2\rho(\dot{G})\leqslant n-2. Moreover, the extremal graphs are completely characterized.

Cite

@article{arxiv.2306.06655,
  title  = {Tur\'{a}n problem for $\mathcal{K}_4^-$-free signed graphs},
  author = {Fan Chen and Xiying Yuan},
  journal= {arXiv preprint arXiv:2306.06655},
  year   = {2023}
}
R2 v1 2026-06-28T11:02:15.690Z