Timeline for Strongly regular graphs with certain parameters
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 26, 2023 at 17:03 | vote | accept | Lior Gishboliner | ||
| Jan 26, 2023 at 9:33 | comment | added | Wlod AA | @FedorPetrov, finally, thank you. | |
| Jan 26, 2023 at 9:31 | comment | added | Fedor Petrov | @WlodAA it is a less known as $O(n)$ but quite useful notation for "at least constant times $n$" | |
| Jan 26, 2023 at 9:30 | answer | added | Fedor Petrov | timeline score: 4 | |
| Jan 26, 2023 at 9:20 | comment | added | Wlod AA | @FedorPetrov, notation $\ \Omega(n)\ $ has jumped out of blue and is hanging in thin air. | |
| Jan 26, 2023 at 9:11 | comment | added | Fedor Petrov | @WlodAA "$\sin x=O(1)$ does not yield $O(1)=\sin x$" | |
| Jan 26, 2023 at 9:03 | comment | added | Wlod AA | It seems that the last two equations can be replace simply by one: $\ 2\cdot\mu= \lambda + d.$ | |
| Jan 26, 2023 at 8:51 | comment | added | Wlod AA | I meant the formulation of the problem. | |
| Jan 26, 2023 at 8:47 | comment | added | Gordon Royle | $n$ is the number of vertices and $d$ is degree/valency of each vertex. | |
| Jan 26, 2023 at 8:31 | comment | added | Wlod AA | Could you define $\ n\ $ and $\ d$? | |
| Jan 26, 2023 at 8:09 | history | edited | Lior Gishboliner |
edited tags
|
|
| Jan 25, 2023 at 22:14 | history | asked | Lior Gishboliner | CC BY-SA 4.0 |