Timeline for Avoiding multiply covered vertices in graph edge coverings
Current License: CC BY-SA 4.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 12, 2019 at 8:33 | comment | added | Dominic van der Zypen | Thanks @M.Winter for writing up this precise answer! | |
| Aug 12, 2019 at 8:12 | history | edited | M. Winter | CC BY-SA 4.0 |
deleted 1 character in body
|
| Aug 11, 2019 at 19:05 | history | edited | M. Winter | CC BY-SA 4.0 |
deleted 25 characters in body
|
| Aug 11, 2019 at 19:02 | comment | added | M. Winter | @JoshuaErde I modified my answer to now explain why the graph must have vertices of infinite degree instead of uncountably many edges. Thank you for your comment in any case. | |
| Aug 11, 2019 at 18:59 | history | undeleted | M. Winter | ||
| Aug 11, 2019 at 18:56 | history | edited | M. Winter | CC BY-SA 4.0 |
added 885 characters in body
|
| Aug 10, 2019 at 13:33 | history | edited | M. Winter | CC BY-SA 4.0 |
added 155 characters in body
|
| Aug 10, 2019 at 12:01 | history | deleted | M. Winter | via Vote | |
| Aug 10, 2019 at 10:11 | comment | added | Joshua Erde | Perhaps I'm missing something, but isn't the vertex set of the graph Florian constructed, and hence also the edge set, countable? | |
| Aug 9, 2019 at 16:03 | history | edited | M. Winter | CC BY-SA 4.0 |
added 64 characters in body
|
| Aug 9, 2019 at 15:52 | history | edited | M. Winter | CC BY-SA 4.0 |
added 64 characters in body
|
| Aug 9, 2019 at 15:32 | history | undeleted | M. Winter | ||
| Aug 9, 2019 at 15:32 | history | edited | M. Winter | CC BY-SA 4.0 |
added 94 characters in body
|
| Aug 9, 2019 at 14:38 | history | edited | M. Winter | CC BY-SA 4.0 |
added 94 characters in body
|
| Aug 9, 2019 at 14:34 | history | deleted | M. Winter | via Vote | |
| Aug 9, 2019 at 14:32 | history | answered | M. Winter | CC BY-SA 4.0 |