Timeline for Extremal examples for a folklore lemma on subgraphs of large minimum degree
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 11, 2014 at 7:48 | comment | added | Janne Kokkala | More precise: If we label the vertices by their coordinates in $\{1,2,\dots,m\}^k$, the lexicographically smallest vertex in the subgraph can't have more than $k$ neighbours (otherwise one of them would be lexicographically smaller). | |
| Apr 10, 2014 at 18:05 | comment | added | BPN | Thanks! I suspect a complete characterisation might be hopeless to begin with, so every example tells us something. | |
| Apr 10, 2014 at 17:49 | history | edited | Peter Dukes | CC BY-SA 3.0 |
added 248 characters in body
|
| Apr 10, 2014 at 17:24 | history | answered | Peter Dukes | CC BY-SA 3.0 |