Indexed metadata
The -Spectral Turán Problem for -Clique Tensors of -Free Graphs
Xiaoqi Liu, Haiying Shan
Source abstract
For fixed and . 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 , one part has size and the remaining parts have size . At , both part-size patterns are asymptotically extremal.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.