## Abstract The Erdős‐Rényi and Projective Norm graphs are algebraically defined graphs that have proved useful in supplying constructions in extremal graph theory and Ramsey theory. Their eigenvalues have been computed and this yields an upper bound on their independence number. Here we show that
On the spectrum of projective norm-graphs
✍ Scribed by Tibor Szabó
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 67 KB
- Volume
- 86
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
✦ Synopsis
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.
📜 SIMILAR VOLUMES
Let X be a Banach space. Given M a subspace of X we denote with P M the metric projection onto M. We define ?(X ) :=sup [&P M &: M a proximinal subspace of X]. In this paper we give a bound for ?(X ). In particular, when X=L p , we obtain the inequality &P M & 2 |2Â p&1| , for every subspace M of L
## Abstract The orientable genus is determined for any graph that embeds into the projective plane, Σ, to be essentially half of the representativity of any embedding into Σ. In addition, a structure is given for any 3‐connected projective planar graph as the union of a spanning planar graph and a