A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
The Spectral Radii of Intersecting Uniform Hypergraphs
2020
Communications on Applied Mathematics and Computation
The celebrated Erdős-Ko-Rado theorem states that given n ⩾ 2k, every intersecting k-uniform hypergraph G on n vertices has at most n − 1 k − 1 edges. This paper states spectral versions of the Erdős-Ko-Rado theorem: let G be an intersecting k-uniform hypergraph on n vertices with n ⩾ 2k. Then, the sharp upper bounds for the spectral radius of A (G) and is a convex linear combination of the degree diagonal tensor D(G) and the adjacency tensor A(G) for 0 ⩽ < 1, and Q * (G) is the incidence
doi:10.1007/s42967-020-00073-7
fatcat:qizeyvoywvazpm7wzvrgqlflva