The graph has 300 vertices, 300 edges. Show that there are 100 vertices that are pairwise non-adjacent.
99746
Vertex cover in a graph with maximum degree of 3 and average degree of 2.
7626
Proving that every connected graph has a vertex whose removal will not disconnect the graph.
99781
Proof that any simple connected graph has at least 2 non-cut vertices.
12557
Coloring Graph Problem
50935
Total number paths between two nodes in a complete graph
97630
A graph which is not a single block has at least two leaf blocks
121130
Graph with even vertices and ${n-1}\choose 2$ $+ 1$ edges has a perfect matching
147282
Prove that in every graph with at least two vertices, there are at least two vertices which have the same degree?
131736
Proving a triangle with different edge colors exists in a graph.
117349
counting triangles in a graph or its complement
100978
If a graph with $n$ vertices and $n$ edges there must a cycle?
38466
Proving that the number of vertices of odd degree in any graph G is even
134242
Graph partition that span a third of edges
100289
Question about self-complementary graphs
91229
Complexity of counting the number of triangles of a graph
17868
How to calculate the number of possible connected simple graphs with $n$ labelled vertices
49045
Graph theory: Tree holds two sub-tree with an amount of vertices