Incidences and the spectra of graphs
From MaRDI portal
Publication:3400873
Recommendations
- Incidences and the Spectra of Graphs
- Fourier analysis and geometric combinatorics
- The Szemerédi-Trotter type theorem and the sum-product estimate in finite fields
- Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory
- Additive combinatorics
Cited in
(14)- Combinatorial problems in finite fields and Sidon sets
- Conditional expanding bounds for two-variable functions over prime fields
- Expanding phenomena over matrix rings
- New bounds on even cycle creating Hamiltonian paths using expander graphs
- scientific article; zbMATH DE number 5844242 (Why is no real title available?)
- scientific article; zbMATH DE number 2152547 (Why is no real title available?)
- Some combinatorial number theory problems over finite valuation rings
- Incidence graphs of biacyclic hypergraphs
- Incidences and the Spectra of Graphs
- Set-codes with small intersections and small discrepancies
- An elementary analog of the operator method in additive combinatorics
- On distinct perpendicular bisectors and pinned distances in finite fields
- Expanders on matrices over a finite chain ring, I
- Cayley sum graphs and their applications to codebooks
This page was built for publication: Incidences and the spectra of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400873)