6 papers
Spectral extremal problems for the -spectral radius of hypergraphs
Jian Zheng, Honghai Li, Li Su
Let be an -vertex -uniform hypergraph, and let be an -vertex -uniform hypergraph. Denote by the number of isomorphic copies of in . Fo…
Spectral Turán-type problems for the -spectral radius of hypergraphs with degree stability
Jian Zheng, Honghai Li, Li Su
An -pattern is an ordered pair , where is a positive integer and is a set of -multisets with elements from . An -graph is said to be -co…
Thin divisible designs graphs: an interplay between fixed-point free involutions of -graphs and symmetric weighing matrices
Sergey Goryainov, Willem H. Haemers, Elena V. Konstantinova +1
In this paper, we illustrate important aspects of the interplay between weighing matrices, -graphs with fixed-point free involutions, and signed graphs with an orthogonal…
Spectral Turán problems for nondegenerate hypergraphs
Jian Zheng, Honghai Li, Yi-Zheng Fan
Keevash, Lenz and Mubayi developed a general criterion for hypergraph spectral extremal problems in their seminal work (SIAM J. Discrete Math., 2014). Their framework shows that ex…
A signless Laplacian spectral Erdös-Stone-Simonovits theorem
Jian Zheng, Honghai Li, Li Su
The celebrated ErdÅs--Stone--Simonovits theorem states that , where is the chromatic number of . I…
The signless Laplacian spectral Turán problems for color-critical graphs
Jian Zheng, Yongtao Li, Honghai Li
The well-known Turán theorem states that if is an -vertex -free graph, then , with equality if and only if is the -partite Turán graph…