English

Degenerate Tur\'an problems for hereditary properties

Combinatorics 2017-01-27 v1

Abstract

Let HH be a graph and ts2t\geq s\geq 2 be integers. We prove that if GG is an nn-vertex graph with no copy of HH and no induced copy of Ks,tK_{s,t}, then λ(G)=O(n11/s)\lambda(G) = O\left(n^{1-1/s}\right) where λ(G)\lambda(G) is the spectral radius of the adjacency matrix of GG. Our results are motivated by results of Babai, Guiduli, and Nikiforov bounding the maximum spectral radius of a graph with no copy (not necessarily induced) of Ks,tK_{s,t}.

Keywords

Cite

@article{arxiv.1701.07693,
  title  = {Degenerate Tur\'an problems for hereditary properties},
  author = {Vladimir Nikiforov and Michael Tait and Craig Timmons},
  journal= {arXiv preprint arXiv:1701.07693},
  year   = {2017}
}
R2 v1 2026-06-22T18:01:16.058Z