On the spectrum and linear programming bound for hypergraphs

by   Sebastian M. Cioabă, et al.

The spectrum of a graph is closely related to many graph parameters. In particular, the spectral gap of a regular graph which is the difference between its valency and second eigenvalue, is widely seen an algebraic measure of connectivity and plays a key role in the theory of expander graphs. In this paper, we extend previous work done for graphs and bipartite graphs and present a linear programming method for obtaining an upper bound on the order of a regular uniform hypergraph with prescribed distinct eigenvalues. Furthermore, we obtain a general upper bound on the order of a regular uniform hypergraph whose second eigenvalue is bounded by a given value. Our results improve and extend previous work done by Feng–Li (1996) on Alon–Boppana theorems for regular hypergraphs and by Dinitz–Schapira–Shahaf (2020) on the Moore or degree-diameter problem. We also determine the largest order of an r-regular u-uniform hypergraph with second eigenvalue at most θ for several parameters (r,u,θ). In particular, orthogonal arrays give the structure of the largest hypergraphs with second eigenvalue at most 1 for every sufficiently large r. Moreover, we show that a generalized Moore geometry has the largest spectral gap among all hypergraphs of that order and degree.



There are no comments yet.


page 1

page 2

page 3

page 4


A spectral version of the Moore problem for bipartite regular graphs

Let b(k,θ) be the maximum order of a connected bipartite k-regular graph...

Eigenvalues of graphs and spectral Moore theorems

In this paper, we describe some recent spectral Moore theorems related t...

On the Relativized Alon Second Eigenvalue Conjecture VI: Sharp Bounds for Ramanujan Base Graphs

This is the sixth in a series of articles devoted to showing that a typi...

1-factorizations of pseudorandom graphs

A 1-factorization of a graph G is a collection of edge-disjoint perfect ...

Equiangular lines and regular graphs

In 1973, Lemmens and Seidel posed the problem of determining N_α(r), the...

Asymptotic spectra of large (grid) graphs with a uniform local structure

We are concerned with sequences of graphs having a grid geometry, with a...

Designing Optimal Multiplex Networks for Certain Laplacian Spectral Properties

We discuss the design of interlayer edges in a multiplex network, under ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.