query: A graph with n points satisfies some conditions.
positive_passages.docid: 147901
positive_passages.text: Show that, in a group of n people, everyone has the same number of friends if..
negative_passages.docid: 142861
negative_passages.text: Multipartite graphs which are not planar
negative_passages.docid: 96803
negative_passages.text: Hall's marriage theorem in bipartite graph
negative_passages.docid: 149538
negative_passages.text: graph theory - clique graph
negative_passages.docid: 107964
negative_passages.text: Simple combinatorics problem.
negative_passages.docid: 90559
negative_passages.text: Partitioning of a graph
negative_passages.docid: 108417
negative_passages.text: Cycles of length k in a complete simple graph with n vertices
negative_passages.docid: 53861
negative_passages.text: N points on a Circle
negative_passages.docid: 140114
negative_passages.text: Using Halls Theorem to show Graph contains a perfect matching containing any edge.
negative_passages.docid: 138643
negative_passages.text: Prove that at most $2k+1$ independent sets form the set of vertices of a graph, where $k$ is the maximum degree.
negative_passages.docid: 90747
negative_passages.text: Upper bound on $\chi(G)$ for a triangle-free graph
negative_passages.docid: 7626
negative_passages.text: Proving that every connected graph has a vertex whose removal will not disconnect the graph.
negative_passages.docid: 23239
negative_passages.text: Prove that the following map has at least $k-2$ fixed points
negative_passages.docid: 127965
negative_passages.text: Graph theory (Graph Connectivity)
negative_passages.docid: 61340
negative_passages.text: Prove that there exists bipartite graph with this degree sequence: $(3,3,3,3,3,5,6,6,6,6,6,6,6,6)$
negative_passages.docid: 123939
negative_passages.text: N circles in the plane
negative_passages.docid: 99746
negative_passages.text: Vertex cover in a graph with maximum degree of 3 and average degree of 2.