Timeline for Does every $4$-connected nonplanar graph contain a $K_5$-minor?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 19, 2021 at 4:45 | comment | added | okw1124 | Thanks for editing! Now I fully understood how to prove it. | |
| Nov 18, 2021 at 23:46 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 1 character in body
|
| Nov 18, 2021 at 18:35 | vote | accept | okw1124 | ||
| Nov 18, 2021 at 8:14 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 6 characters in body
|
| Nov 18, 2021 at 0:32 | history | edited | Tony Huynh | CC BY-SA 4.0 |
added 394 characters in body
|
| Nov 17, 2021 at 12:46 | comment | added | okw1124 | Thanks for nice reference! But I cannot understand his paper since it's written in Deutsch... Can you explain a brief sketch of the proof? If it is not easy, I may post another question about it. | |
| Nov 17, 2021 at 11:12 | history | answered | Tony Huynh | CC BY-SA 4.0 |