Approximately Strongly Regular Graphs
Ferdinand Ihringer

TL;DR
This paper introduces the concept of approximately strongly regular graphs, providing bounds and applying these to extremal problems in combinatorics and finite geometry.
Contribution
It develops variants of classical bounds for graphs with spectra similar to strongly regular graphs and applies these to problems in projective geometry and pseudorandom graph theory.
Findings
Caps in projective spaces have size at most O(q^{3n/4})
Pseudorandom K_m-free graphs have degree bounds of O(v^{1 - 1/(3m-2i-5)})
Results extend bounds and properties of strongly regular graphs to approximate cases
Abstract
We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to extremal problems. Among other things, we show the following: (1) Caps in for which the number of secants on exterior points does not vary too much, have size at most (as or as ). (2) Optimally pseudorandom -free graphs of order and degree for which the induced subgraph on the common neighborhood of a clique of size is similar to a strongly regular graph, have .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Graph theory and applications · Limits and Structures in Graph Theory
