Eigenvalues of non-regular linear quasirandom hypergraphs
From MaRDI portal
Publication:2374170
Abstract: Chung, Graham, and Wilson proved that a graph is quasirandom if and only if there is a large gap between its first and second largest eigenvalue. Recently, the authors extended this characterization to k-uniform hypergraphs, but only for the so-called coregular k-uniform hypergraphs. In this paper, we extend this characterization to all k-uniform hypergraphs, not just the coregular ones. Specifically, we prove that if a k-uniform hypergraph satisfies the correct count of a specially defined four-cycle, then there is a gap between its first and second largest eigenvalue.
Recommendations
- Eigenvalues and linear quasirandom hypergraphs
- Eigenvectors and eigenvalues of non-regular graphs
- Extreme eigenvalues of nonregular graphs
- On the largest eigenvalue of non-regular graphs
- On the largest eigenvalue of non-regular graphs
- On the almost eigenvectors of random regular graphs
- On the eigenvalues of non-commuting graphs
- The largest eigenvalue of nonregular graphs
- A note on the largest eigenvalue of non-regular graphs
- Hypergraph regularity and quasi-randomness
Cites work
Cited in
(11)- Spectra of random regular hypergraphs
- Perfect Packings in Quasirandom Hypergraphs II
- Perfect packings in quasirandom hypergraphs. I.
- Inverse expander mixing for hypergraphs
- On the first and second eigenvalue of finite and infinite uniform hypergraphs
- The poset of hypergraph quasirandomness
- Adjacency spectra of random and complete hypergraphs
- Eigenvalues and linear quasirandom hypergraphs
- Natural quasirandomness properties
- Quasirandomness in hypergraphs
- Quasirandomness in hypergraphs
This page was built for publication: Eigenvalues of non-regular linear quasirandom hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2374170)