A connected graph with n vertices has at least n-1 edges
6429
prove that a connected graph with $n$ vertices has at least $n-1$ edges
71170
Upper Bound on the Chromatic Number of a Graph with No Two Disjoint Odd Cycles
75101
Let G = (V, E) be a simple undirected graph with n = |V | ≥ 1 vertices...
49193
Constructing a graph from a degree sequence
90747
Upper bound on $\chi(G)$ for a triangle-free graph
142861
Multipartite graphs which are not planar
28877
Graph with $k$ components.
134242
Graph partition that span a third of edges
71154
Why a complete graph has $\frac{n(n-1)}{2}$ edges?
84654
The graph of xy = 1 is connected or not
65639
Existence of a self-complementary graph
123626
Prove that even $n$ can be partitioned to $\frac n2$ edges
17086
The number of (non-equal) forests on the vertex set V = {1, 2, ...,n} that contains exactly 2 connected components is given by
153227
Connected graph with minimum distance
29467
Prove that the minimum number of cycles is $m-n+1$
38466
Proving that the number of vertices of odd degree in any graph G is even
37754
Number of vertices of a complete graph with $n$ edges