Timeline for Handshaking Lemma
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 1, 2019 at 18:17 | comment | added | Ben Barber | I'm speaking about the auxiliary graph there, where $P$ is a vertex so has a degree in the usual sense. By joined I mean what elsewhere I called adjacent; there is an edge between them (in this case in the auxiliary graph). | |
| Mar 1, 2019 at 17:51 | comment | added | vidyarthi | and by joining of paths you mean adding an edge? | |
| Mar 1, 2019 at 17:51 | comment | added | vidyarthi | by degree of $P$, you mean the number of edges of the path? | |
| Mar 1, 2019 at 17:42 | comment | added | Ben Barber | If you really are interested in multigraphs then you should check what happens if $x$ is adjacent to $z_n$ multiple times. | |
| Mar 1, 2019 at 17:26 | history | answered | Ben Barber | CC BY-SA 4.0 |