Timeline for Linear independence of vectors in Graph Theory
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 3, 2021 at 20:49 | comment | added | Honza | Sorry about my careless and embarrassing $n$ versus $m$ confusion - hopefully fixed now. | |
| Feb 3, 2021 at 2:47 | history | edited | Honza | CC BY-SA 4.0 |
added 15 characters in body
|
| Feb 2, 2021 at 22:41 | comment | added | Sam Hopkins | I think it is here: math.stackexchange.com/questions/4003961/… | |
| Feb 2, 2021 at 22:15 | comment | added | Gerry Myerson | Please include a link to the question on math.stackexchange (if that's where you posted it, Honza). | |
| Feb 2, 2021 at 14:55 | comment | added | Sam Hopkins | Whoops just noticed comment of @GordonRoyle says same thing. | |
| Feb 2, 2021 at 14:55 | comment | added | Sam Hopkins | An error: there are $m-n+1$ such cycles. So the non-singular matrix you get in the end is $m\times m$, not $n\times n$. What you've done is found a basis for the cut space and the cycle space of the (matroid of the) graph, and it's well known that the sum of cut and cycle spaces is the whole edge space. | |
| Feb 2, 2021 at 14:55 | comment | added | Gordon Royle | Your $m$ and $n$ seem to be mixed up in a couple of places. | |
| Feb 2, 2021 at 14:48 | comment | added | Sam Hopkins | "Regular" = "non-singular"? | |
| Feb 2, 2021 at 14:38 | history | asked | Honza | CC BY-SA 4.0 |