Timeline for Proofs of parity results via the Handshaking lemma
Current License: CC BY-SA 4.0
7 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 12 at 1:31 | history | edited | Timothy Chow | CC BY-SA 4.0 |
Added "EDIT 2"
|
Dec 28, 2022 at 7:20 | history | edited | Martin Sleziak | CC BY-SA 4.0 |
http -> https (the question was bumped anyway)
|
Dec 28, 2022 at 0:08 | history | edited | Timothy Chow | CC BY-SA 4.0 |
Improved references
|
Jan 14, 2018 at 13:16 | history | made wiki | Post Made Community Wiki by Todd Trimble | ||
Oct 13, 2011 at 3:57 | comment | added | darij grinberg | BTW, I think that Peter Scholze gave an even simpler proof of the Theorem 1 from the Cameron-Edmonds you paper you cited: artofproblemsolving.com/Forum/viewtopic.php?p=606461#p606461 . At least it does not have to consider lollipops. Or am I missing anything? | |
Oct 13, 2011 at 3:55 | comment | added | darij grinberg | Chevalley-Warning over $\mathbb F_2$? | |
Oct 12, 2011 at 16:04 | history | answered | Timothy Chow | CC BY-SA 3.0 |