Discrete math - Prove that a tree with n nodes must have exactly n - 1 edges?
10910
How many edges does an undirected tree with $n$ nodes have?
146933
Proving bipartition in a connected planar graph
49045
Graph theory: Tree holds two sub-tree with an amount of vertices
54516
Number of edges of any spanning tree of a graph $G$ coming from a subgraph of $G$
33316
Show that if $G$ is simple a graph with $n$ vertices and 􏰈the number of edges $m>\binom{n-1}{2}$, then $G$ is connected.
140114
Using Halls Theorem to show Graph contains a perfect matching containing any edge.
27373
Graph Proof by induction.
67887
Prove that a graph on $n$ vertices with girth $g$ has at most $\frac{g}{g-2}(n-2)$ edges
17868
How to calculate the number of possible connected simple graphs with $n$ labelled vertices
114277
Proving in Discrete Structures Problem that $2^N = \binom{N}{0} + \binom{N}{1} + \binom{N}{2} + \dots + \binom{N}{N}$
100832
Number of binary trees with $N$ nodes
1409
Proving that the given set has at most $2^{n-1}$ elements
100256
Proof by induction on a rooted tree with even number of vertices
48838
Proving the number of $n$ length binary strings with no consecutive $1's$ $b_n$ is equal to $b_{n-1} + b_{n-2}$
29467
Prove that the minimum number of cycles is $m-n+1$
72267
Prove there's a simple path of length $k$ in a simple graph $G$ where all the vertices have degree of at least $k$
150719
All nonisomorphic trees of order $n$