Timeline for A simple equality for book embedding of two graphs
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 24, 2019 at 1:46 | vote | accept | Jacob.Z.Lee | ||
| Nov 22, 2019 at 23:44 | answer | added | user26635 | timeline score: 2 | |
| Nov 21, 2019 at 20:05 | comment | added | Ilya Bogdanov | I don't think so. Every graph can be embedded into a book with 3 pages (but an edge may pass from page to page indefinitely). If your claim were true, the page number of any graph would be at most 3. | |
| Nov 21, 2019 at 14:45 | history | edited | Jacob.Z.Lee | CC BY-SA 4.0 |
deleted 8 characters in body
|
| Nov 21, 2019 at 14:39 | history | edited | Jacob.Z.Lee | CC BY-SA 4.0 |
added 91 characters in body
|
| Nov 21, 2019 at 14:22 | history | asked | Jacob.Z.Lee | CC BY-SA 4.0 |