Timeline for What is known about the non-existence of strongly regular graphs srg(n,k,0,2)?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 22, 2020 at 2:50 | history | edited | Florent Foucaud | CC BY-SA 4.0 |
added 13 characters in body
|
| Feb 20, 2020 at 10:44 | vote | accept | Florent Foucaud | ||
| Feb 20, 2020 at 10:28 | answer | added | Dima Pasechnik | timeline score: 6 | |
| Feb 20, 2020 at 10:04 | comment | added | Dima Pasechnik | Yes. A canonical reference is doi.org/10.1016/S0304-0208(08)73275-4 (can't get through the paywall though :- ( ) | |
| Feb 20, 2020 at 10:03 | comment | added | Florent Foucaud | Thanks, I did not know this name. So basically srg(n,k,0,2) graphs are rectagraphs of diameter 2. | |
| Feb 20, 2020 at 9:28 | comment | added | Dima Pasechnik | a keyword here is "rectagraph" (trinagle-free graph with every pair of vertices at distance 2 having exactly 2 common neighbours). | |
| Feb 20, 2020 at 7:23 | history | asked | Florent Foucaud | CC BY-SA 4.0 |