On the clique number of a strongly regular graph
Gary R. W. Greaves, Leonard H. Soicher
TL;DR
This paper introduces improved upper bounds for the clique numbers of strongly regular graphs, surpassing existing bounds like Delsarte's for many parameter sets, including those related to Paley graphs.
Contribution
It provides new theoretical bounds for clique numbers in strongly regular graphs, extending the understanding of their combinatorial properties.
Findings
New upper bounds for clique numbers in strongly regular graphs
Bounds improve upon Delsarte's bound for many parameters
Applicable to infinitely many feasible parameter tuples, including Paley graphs
Abstract
We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasible parameter tuples for strongly regular graphs, including infinitely many parameter tuples that correspond to Paley graphs.
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.