Timeline for A conjecture on planar graphs
Current License: CC BY-SA 4.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 6, 2022 at 17:20 | history | edited | Michael Hardy | CC BY-SA 4.0 |
proper use of \deg
|
| Jul 5, 2017 at 18:40 | comment | added | Brendan McKay | @TonyHuynh It seems that if every subgraph has average degree at most $\Delta$, then $L(G)\le \Delta^2 n+O(1)$, and no other conditions are needed. | |
| Jul 5, 2017 at 17:30 | comment | added | Tony Huynh | Nice! Note that the only place that planarity is used is that every subgraph of a planar graph only has linear number of edges. So the claim is also true for every minor-closed class of graphs (with different constants). | |
| Jul 5, 2017 at 6:14 | vote | accept | Zur Luria | ||
| Jul 4, 2017 at 23:40 | history | edited | Brendan McKay | CC BY-SA 3.0 |
added 115 characters in body
|
| Jul 4, 2017 at 23:33 | history | edited | Brendan McKay | CC BY-SA 3.0 |
added 114 characters in body
|
| Jul 4, 2017 at 23:08 | history | edited | Brendan McKay | CC BY-SA 3.0 |
added 110 characters in body
|
| Jul 4, 2017 at 22:55 | history | edited | Brendan McKay | CC BY-SA 3.0 |
added 66 characters in body
|
| Jul 4, 2017 at 22:49 | history | edited | Brendan McKay | CC BY-SA 3.0 |
added 66 characters in body
|
| Jul 4, 2017 at 22:16 | history | answered | Brendan McKay | CC BY-SA 3.0 |