|
2 | included link to definition of strongly regular graph | ||
|
I have heard through the academic rumor mill (my advisor heard from so-and-so about a result they heard from big-name who saw it in some journal, etc.) of the following theorem: Theorem: Almost all strongly regular graphs have trivial automorphism group. This contrasts that most known families of strongly regular graphs have high symmetry, due to their constructions using algebraic objects. Does anyone know the reference for this theorem? Also, what is the measure used to describe "almost all"? |
||||
|
|
1 |
|
||
Are "almost all" strongly regular graphs rigid?I have heard through the academic rumor mill (my advisor heard from so-and-so about a result they heard from big-name who saw it in some journal, etc.) of the following theorem: Theorem: Almost all strongly regular graphs have trivial automorphism group. This contrasts that most known families of strongly regular graphs have high symmetry, due to their constructions using algebraic objects. Does anyone know the reference for this theorem? Also, what is the measure used to describe "almost all"?
|
||||
