On the spectrum and linear programming bound for hypergraphs

DOI10.1016/J.EJC.2022.103535zbMath1490.05193arXiv2009.03022OpenAlexW3083511639WikidataQ114184725 ScholiaQ114184725MaRDI QIDQ2143404

Takayuki Okuda, Sebastian M. Cioabă, Jack H. Koolen, Hiroshi Nozaki, Masato Mimura

Publication date: 31 May 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.03022

zbMATH Keywords

adjacency matrixdegree-diameter problemregular hypergraphAlon-Boppana theorem

Mathematics Subject Classification ID

Linear programming (90C05) Hypergraphs (05C65) Expander graphs (05C48)

Related Items (1)

A Spectral Moore Bound for Bipartite Semiregular Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-regular graphs
• Spectra of uniform hypergraphs
• Turán problems and shadows. I: Paths and cycles
• Spectra of graphs
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Quantum probability and spectral analysis of graphs. With a foreword by Professor Luigi Accardi.
• Linear programming bounds for regular graphs
• Laplacian eigenvalues and partition problems in hypergraphs
• Eigenvalues and expanders
• On the existence of certain distance-regular graphs
• The finite upper half space and related hypergraphs
• Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
• On the second eigenvalue of hypergraphs
• Ramanujan hypergraphs
• Spectra of regular graphs and hypergraphs and orthogonal polynomials
• Spectra of hypergraphs and applications
• A spectral version of the Moore problem for bipartite regular graphs
• Approximate Moore graphs are good expanders
• The theta number of simplicial complexes
• Interlacing families. I: Bipartite Ramanujan graphs of all degrees
• Spectra of combinatorial Laplace operators on simplicial complexes
• Eigenvalues of a real supersymmetric tensor
• A generalization of Moore graphs of diameter two
• Some Ramanujan hypergraphs associated to $GL(n,\mathbb {F}_q)$
• Maximizing the Order of a Regular Graph of Given Valency and Second Eigenvalue
• Harmonic Analysis on Symmetric Spaces—Higher Rank Spaces, Positive Definite Matrix Space and Generalizations
• Mixing Rates of Random Walks with Little Backtracking
• Simplicial complexes: Spectrum, homology and random walks
• Shifted simplicial complexes are Laplacian integral
• On Moore Graphs with Diameters 2 and 3
• Universally optimal distribution of points on spheres
• A Survey on Spectra of infinite Graphs
• On the Maximum Diameter of a Class of Distance-Regular Graphs
• Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
• Ramanujan Type Buildings
• Transversals in Latin Squares

This page was built for publication: On the spectrum and linear programming bound for hypergraphs