Timeline for Rank and edges in a combinatorial graph?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 13, 2019 at 15:00 | comment | added | M. Winter | @Turbo Wait, are you asking about the rank of the adjacency matrix or the rank of $M$? | |
| Aug 13, 2019 at 14:52 | comment | added | Turbo | @M.Winter Don't know since we round. | |
| Aug 13, 2019 at 14:36 | comment | added | M. Winter | Shouldn't the rank of $M$ simply be $d$ (in $\Bbb R$ and $\Bbb F_2$), as the matrix contains the $d\times d$-identitiy matrix as a submatrix? | |
| Aug 13, 2019 at 14:06 | answer | added | M. Winter | timeline score: 2 | |
| Aug 13, 2019 at 14:06 | comment | added | Turbo | True $n = 2^{d}$. | |
| Aug 13, 2019 at 14:05 | comment | added | Fedor Petrov | $n=2^d$, right? | |
| Aug 13, 2019 at 13:51 | history | asked | Turbo | CC BY-SA 4.0 |