Eigenvalues and linear quasirandom hypergraphs
From MaRDI portal
Publication:5496786
Abstract: Let p(k) denote the partition function of k. For each k >= 2, we describe a list of p(k)-1 quasirandom properties that a k-uniform hypergraph can have. Our work connects previous notions on linear hypergraph quasirandomness of Kohayakawa-R"odl-Skokan and Conlon-H`{a}n-Person-Schacht and the spectral approach of Friedman-Wigderson. For each of the quasirandom properties that are described, we define a largest and second largest eigenvalue. We show that a hypergraph satisfies these quasirandom properties if and only if it has a large spectral gap. This answers a question of Conlon-H`{a}n-Person-Schacht. Our work can be viewed as a partial extension to hypergraphs of the seminal spectral results of Chung-Graham-Wilson for graphs.
Recommendations
Cites work
- A hypergraph regularity method for generalized Turán problems
- Constructive lower bounds for off-diagonal Ramsey numbers
- Eigenvalues and expanders
- Expander graphs and their applications
- Explicit Concentrators from Generalized N-Gons
- High-ordered random walks and generalized Laplacians on hypergraphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Hypergraphs, quasi-randomness, and conditions for regularity
- Loose Laplacian spectra of random hypergraphs
- Multicolor Ramsey numbers for complete bipartite versus complete graphs
- On codes from hypergraphs.
- On the second eigenvalue of hypergraphs
- On the spectrum of projective norm-graphs
- Quasi-random graphs
- Quasi-random hypergraphs
- Quasi-random hypergraphs revisited
- Quasirandom Groups
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Quasi‐random classes of hypergraphs
- Regularity lemmas for hypergraphs and quasi-randomness
- Sharp bounds for some multicolour Ramsey numbers
- Some Ramanujan hypergraphs associated to GL\((n,\mathbb{F}_q)\)
- Some graphs with small second eigenvalue
- Spectra of hypergraphs and applications
- Spectra of uniform hypergraphs
- The finite upper half space and related hypergraphs
- The uniformity lemma for hypergraphs
- Weak hypergraph regularity and linear hypergraphs
- Weak quasi-randomness for uniform hypergraphs
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Cited in
(24)- Deterministic tensor completion with hypergraph expanders
- On the first and second eigenvalue of finite and infinite uniform hypergraphs
- Perfect packings in quasirandom hypergraphs. I.
- Natural quasirandomness properties
- Quasirandomness in hypergraphs
- Quasirandomness in hypergraphs
- Quasi-random Boolean functions
- Perfect Packings in Quasirandom Hypergraphs II
- σ-algebras for quasirandom hypergraphs
- Spectra of random regular hypergraphs
- Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms
- Sparse random tensors: concentration, regularization and applications
- Adjacency spectra of random and complete hypergraphs
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
- The Erdős-Hajnal hypergraph Ramsey problem
- Linear quasi-randomness of subsets of abelian groups and hypergraphs
- Linear quasi-randomness of subsets of abelian groups and hypergraphs
- Principal eigenvectors of general hypergraphs
- Eigenvalues of non-regular linear quasirandom hypergraphs
- Tiling multipartite hypergraphs in quasi-random hypergraphs
- Hamilton cycles in quasirandom hypergraphs
- Forcing quasirandomness with triangles
- Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
- F$F$‐factors in Quasi‐random Hypergraphs
This page was built for publication: Eigenvalues and linear quasirandom hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5496786)
