Timeline for Infinite complete minor in $\min,\max$-graph on $\mathbb{N}$
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 16 at 14:57 | vote | accept | Dominic van der Zypen | ||
| Jul 16 at 8:10 | answer | added | Louis Esperet | timeline score: 1 | |
| Jul 12 at 10:59 | comment | added | Florian Lehner | $H$ is a topological minor of $G$ if $G$ has a subgraph which is isomorphic to a subdivision of $H$ | |
| Jul 12 at 4:44 | comment | added | Dominic van der Zypen | What's the definition of a topological minor? | |
| Jul 10 at 22:57 | comment | added | Florian Lehner | I do not see how an infinite matching would give an infinite complete minor, but it looks like the graph is infinitely vertex connected, so a greedy construction will even give you an infinite topological minor. | |
| Jul 10 at 19:21 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |