Timeline for List of counting proofs instead of linear algebra method in combinatorics
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 8, 2021 at 9:30 | answer | added | bof | timeline score: 1 | |
| Feb 5, 2021 at 22:15 | comment | added | bof | What about the "lights out" theorem, which says that for every finite graph $G$ there is a set $S\subseteq V(G)$ such that $|N[v]\cap S|$ is odd for every $v\in V(G)$? The special case where $G$ is a tree has an easy proof without linear algebra. Is there a graph-theoretical proof of the general result? | |
| Feb 15, 2016 at 15:37 | comment | added | Russ Woodroofe | Is it possible that there might be some kind of shifting-type proof of Oddtown? | |
| Feb 12, 2016 at 1:33 | history | edited | domotorp | CC BY-SA 3.0 |
added link to Oddtown thm
|
| Feb 12, 2016 at 0:34 | answer | added | Marcelo Campos | timeline score: -4 | |
| Feb 11, 2016 at 23:25 | answer | added | Tony Huynh | timeline score: 2 | |
| Feb 11, 2016 at 22:41 | comment | added | Timothy Chow | Possibly related: cstheory.stackexchange.com/questions/5099/… | |
| Feb 11, 2016 at 22:41 | answer | added | Timothy Chow | timeline score: 3 | |
| Feb 11, 2016 at 21:43 | answer | added | Fedor Petrov | timeline score: 20 | |
| Feb 11, 2016 at 15:11 | history | asked | domotorp | CC BY-SA 3.0 |