WorksMathematics
The -Spectral Turán Problem for -Clique Tensors of -Free Graphs
Abstract
For fixed and , we study the maximum --clique spectral radius among -vertex -free graphs. Here , where and are the adjacency and degree tensors of the -clique hypergraph of . For , put . We prove that, for all sufficiently large , the unique extremal graph is the Turán graph if , and if . For general and , every extremal graph is complete -partite. The asymptotic maximum --clique spectral radius among -vertex -free graphs is . In every asymptotically extremal sequence of complete -partite graphs, all parts have size when ; when , one part has size and the remaining parts have size . At , both part-size patterns are asymptotically extremal.