query: Number of vertices of a complete graph with $n$ edges
positive_passages.docid: 148535
positive_passages.text: Finding the "triangular root" of a number.
negative_passages.docid: 79631
negative_passages.text: Find a graph on eight vertices with a pair of pseudosimilar vertices
negative_passages.docid: 90747
negative_passages.text: Upper bound on $\chi(G)$ for a triangle-free graph
negative_passages.docid: 57954
negative_passages.text: How many transitive relations on a set of $n$ elements?
negative_passages.docid: 119543
negative_passages.text: Counting edges in a specially defined graph
negative_passages.docid: 83872
negative_passages.text: Isomorphisms for graphs with loops and multiple edges
negative_passages.docid: 59247
negative_passages.text: How many connected graphs over V vertices and E edges?
negative_passages.docid: 147282
negative_passages.text: Prove that in every graph with at least two vertices, there are at least two vertices which have the same degree?
negative_passages.docid: 49045
negative_passages.text: Graph theory: Tree holds two sub-tree with an amount of vertices
negative_passages.docid: 138465
negative_passages.text: Graph Coloring and Complete Graph
negative_passages.docid: 18801
negative_passages.text: How can I compute the chromatic number of a graph?
negative_passages.docid: 89531
negative_passages.text: Show that every graph $G$ has a bipartite subgraph with at least half of the edges of $G$
negative_passages.docid: 28877
negative_passages.text: Graph with $k$ components.
negative_passages.docid: 38700
negative_passages.text: the Nordhaus-Gaddum problems for chromatic number of graph and its complement
negative_passages.docid: 7062
negative_passages.text: Can the complete graph $K_9$, be 2-coloured with no blue $K_4$ or red triangles?
negative_passages.docid: 68638
negative_passages.text: Show that if $n\geq 3$, the complete graph on $n$ vertices $K_n$ contains a Hamiltonian cycle.
negative_passages.docid: 108631
negative_passages.text: Calulating the Ramsey number $R(T, K_{1,n})$ of a tree $T$ and bipartite graph $K_{1,n}$