Timeline for Is there a graph-theoretical proof of Tutte's theorem on matroids?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 8, 2020 at 14:03 | comment | added | Jaehyeon Seo | I have a question to the last paragraph. Consider a graph which consists of a hexagon and three antipodal diagonals (i.e. a $K_{3,3}$). Add vertices in the middle of two diagonals, and connect them. Then for the outer 6-cycle $C$, there are two $C$-fragments. How can this example be understood by the last paragraph? | |
| Oct 22, 2013 at 8:12 | comment | added | Jack M | Thanks, the bipartite thing was a typo. The thing is, I was hoping to use Tutte's theorem to prove Kuratowski's theorem, hence the requirement that the proof be independant of Kuratowski. | |
| Oct 22, 2013 at 1:01 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 4 characters in body
|
| Oct 22, 2013 at 0:55 | history | answered | Tony Huynh | CC BY-SA 3.0 |