The asymptotics of strongly regular graphs
| dc.creator | Nikiforov, Vladimir | |
| dc.date | 2004-03-25 | |
| dc.date.accessioned | 2026-07-07T05:06:46Z | |
| dc.date.available | 2026-07-07T05:06:46Z | |
| dc.description | A strongly regular graph is called trivial if it or its complement is a union of disjoint cliques. We prove that every infinite family of nontrivial strongly regular graphs is quasi-random in the sense of Chung, Graham and Wilson. | |
| dc.identifier | https://arxiv.org/abs/math/0403450 | |
| dc.identifier | http://arxiv.org/abs/math/0403450 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/70599 | |
| dc.subject | Combinatorics | |
| dc.subject | 05E30 | |
| dc.title | The asymptotics of strongly regular graphs | |
| dc.type | text |