On the spectrum of projective norm-graphs

DOI10.1016/S0020-0190(02)00482-9zbMath1173.68613OpenAlexW2062748612MaRDI QIDQ1007575

Tibor Szabó

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00482-9

zbMATH Keywords

combinatorial problemsGaussian sumpseudorandom graphprojective norm-graph

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (10)

Multicolor bipartite Ramsey numbers of \(K_{t, s}\) and large \(K_{n, n}\) ⋮ Multicolor Ramsey Numbers For Complete Bipartite Versus Complete Graphs ⋮ A note on eigenvalue bounds for independence numbers of non-regular graphs ⋮ Cayley sum graphs and their applications to codebooks ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Unimodular graphs and Eisenstein sums ⋮ Many \(T\) copies in \(H\)-free graphs ⋮ Clustering coefficients of large networks ⋮ Regular Turán numbers of complete bipartite graphs ⋮ EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
• Equations over finite fields. An elementary approach
• Norm-graphs: Variations and applications
• Constructive bounds for a Ramsey-type problem
• On generalized Ramsey theory: The bipartite case
• Norm-graphs and bipartite Turán numbers
• Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
• Constructive lower bounds for off-diagonal Ramsey numbers

This page was built for publication: On the spectrum of projective norm-graphs