Linear spectral Turan problems for expansions of graphs with given chromatic number

Chuan-Ming She, Yi-Zheng Fan, Liying Kang +1

An $r$-uniform hypergraph is linear if every two edges intersect in at most one vertex. The $r$-expansion $F^r$ of a graph $F$ is the $r$-uniform hypergraph obtained from $F$ by…