On the spectrum of projective norm-graphs

Authors:
Tibor Szabó
Affiliations:
Department of Computer Science, ETH Zürich, 8092 Zürich, Switzerland
Venue:
Information Processing Letters
Year:
2003

Citing 5
Cited 1

Eigenvalues, geometric expanders, sorting in rounds, amd Ramsey theory

Combinatorica
Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Norm-graphs: variations and applications

Journal of Combinatorial Theory Series B
On generalized Ramsey theory: The bipartite case

Journal of Combinatorial Theory Series B
Some Exact Results and New Asymptotics for Hypergraph Turán Numbers

Combinatorics, Probability and Computing

MaxCut in ${\bm H)$-Free Graphs

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show that the projective norm-graphs of Alon et al. [J. Combin. Theory Ser. B 76 (1999) 280-290] are pseudorandom in the sense that their second eigenvalue is as small as the square root of the degree. Our approach is simple, it only uses the evaluation of Gaussian sums and determines the complete spectrum exactly.