Timeline for Universal graph
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 23 at 21:09 | comment | added | Florian Lehner | @FedorPetrov it is fairly similar; essentially it also uses the fact that there are too many finite rooted graphs with maximum degree 3 to embed them with the root at some fixed vertex | |
| Jan 23 at 13:13 | comment | added | Timothy Chow | Link to paper by Florian Lehner: A note on classes of subgraphs of locally finite graphs (DOI), J. Combin. Theory Ser. B 161 (2023), 52–62. | |
| Jan 23 at 8:17 | comment | added | Fedor Petrov | @FlorianLehner only irrelevant self-promotion is shameful :) By the way, is your argument similar to this? | |
| Jan 23 at 5:29 | comment | added | Florian Lehner | To add a reference and some shameless self-promotion to this answer: this is Theorem 1.2 in my paper "A note on classes of subgraphs of locally finite graphs" | |
| Jan 22 at 20:34 | vote | accept | Anton Petrunin | ||
| Jan 22 at 20:32 | comment | added | Noah Schweber | Well, that explains why I was having trouble proving a positive answer! | |
| Jan 22 at 19:51 | history | answered | Fedor Petrov | CC BY-SA 4.0 |