query: Graph Theory- show maximum number of edges in a simple graph
positive_passages.docid: 18117
positive_passages.text: Maximum number of edges in a simple graph?
negative_passages.docid: 72267
negative_passages.text: Prove there's a simple path of length $k$ in a simple graph $G$ where all the vertices have degree of at least $k$
negative_passages.docid: 83434
negative_passages.text: Graph theory induction
negative_passages.docid: 102539
negative_passages.text: Min. number of vertices in graph as function of $\kappa(G)$ and $\operatorname{diam}(G)$
negative_passages.docid: 121130
negative_passages.text: Graph with even vertices and ${n-1}\choose 2$ $+ 1$ edges has a perfect matching
negative_passages.docid: 142917
negative_passages.text: Graph vertex chromatic number in a union of 2 sub-graphs
negative_passages.docid: 119304
negative_passages.text: Latin Square and Graph Theory
negative_passages.docid: 154564
negative_passages.text: Prove that the sum of minimum edge cover and maximum matching is the vertex count
negative_passages.docid: 33316
negative_passages.text: 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.
negative_passages.docid: 126428
negative_passages.text: Prove the edges of a multigraph may be oriented such that the net-degree of any vertex is $\leq 1$.
negative_passages.docid: 19807
negative_passages.text: Connected graph with colored edges
negative_passages.docid: 17868
negative_passages.text: How to calculate the number of possible connected simple graphs with $n$ labelled vertices
negative_passages.docid: 93304
negative_passages.text: How to prove Graph with $n$ vertices has Edge Chromatic Number no more than $n/2$ edges
negative_passages.docid: 27373
negative_passages.text: Graph Proof by induction.
negative_passages.docid: 149538
negative_passages.text: graph theory - clique graph
negative_passages.docid: 115085
negative_passages.text: number of vertices in a self-complemntary graph
negative_passages.docid: 158856
negative_passages.text: Prove that a graph with the same number of edges and vertices contains one cycle