Timeline for Theorems proved using combinatorial nullstellensatz that have no other known proof
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 20, 2019 at 10:47 | answer | added | Louis Esperet | timeline score: 5 | |
| Mar 20, 2019 at 10:30 | comment | added | Louis Esperet | You're completely right, thank you. | |
| Mar 20, 2019 at 9:04 | comment | added | Fedor Petrov | @LouisEsperet if I am not mistaken, there exists a combinatorial proof using the kernel technique (for all bipartite graphs with outdegrees at most $m$ and coloring with $m+1$ colors.) | |
| Apr 13, 2017 at 12:57 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Jun 9, 2015 at 14:04 | comment | added | Anurag | @Louis: Thanks. That looks like a good candidate. | |
| Jun 9, 2015 at 13:21 | comment | added | Louis Esperet | You can start with the 3-choosability of bipartite planar graphs. I don't know of any other proof (but maybe nobody looked for such a proof since the Alon Tarsi paper) | |
| Jun 4, 2015 at 0:32 | history | asked | Anurag | CC BY-SA 3.0 |