Degree-sum formula and handshaking lemma #
The degree-sum formula is that the sum of the degrees of the vertices in a finite graph is equal to twice the number of edges. The handshaking lemma, a corollary, is that the number of odd-degree vertices is even.
Main definitions #
dartis a directed edge, consisting of an ordered pair of adjacent vertices, thought of as being a directed edge.
simple_graph.sum_degrees_eq_twice_card_edgesis the degree-sum formula.
simple_graph.even_card_odd_degree_verticesis the handshaking lemma.
simple_graph.odd_card_odd_degree_vertices_neis that the number of odd-degree vertices different from a given odd-degree vertex is odd.
simple_graph.exists_ne_odd_degree_of_exists_odd_degreeis that the existence of an odd-degree vertex implies the existence of another one.
Implementation notes #
We give a combinatorial proof by using the facts that (1) the map from darts to vertices is such that each fiber has cardinality the degree of the corresponding vertex and that (2) the map from darts to edges is 2-to-1.
simple graphs, sums, degree-sum formula, handshaking lemma
The degree-sum formula. This is also known as the handshaking lemma, which might
more specifically refer to