The p-spectral radius of k-partite and k-chromatic uniform hypergraphs

Abstract

We characterize the r-graph with maximal p-spectral radius among the k-partite r-graphs of order n, and the 3-graph with maximal p-spectral radius among the k-chromatic 3-graphs of order n.

23 pages

References in corpus (1)

• An analytic theory of extremal hypergraph problems

Cited by in corpus (1)

• Extremal problems for the p-spectral radius of graphs