query: Ramsey (graph) theory question with tree and girth
positive_passages.docid: 148175
positive_passages.text: Girth and monochromatic copy of trees
negative_passages.docid: 100256
negative_passages.text: Proof by induction on a rooted tree with even number of vertices
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: 83434
negative_passages.text: Graph theory induction
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: 76104
negative_passages.text: Bipartite graph. average degree. Euler circuit.
negative_passages.docid: 60492
negative_passages.text: Why girth of Petersen Graph is five? (Proof)
negative_passages.docid: 142917
negative_passages.text: Graph vertex chromatic number in a union of 2 sub-graphs
negative_passages.docid: 137931
negative_passages.text: Problem from "The Theory of Finite Groups" by Kurzweil and Stellmacher
negative_passages.docid: 54516
negative_passages.text: Number of edges of any spanning tree of a graph $G$ coming from a subgraph of $G$
negative_passages.docid: 146204
negative_passages.text: Subsets sharing at most $i$ elements
negative_passages.docid: 90559
negative_passages.text: Partitioning of a graph
negative_passages.docid: 72417
negative_passages.text: Bipartite graphs
negative_passages.docid: 113015
negative_passages.text: Eulerian Paths in a Complete Graph $K_5$
negative_passages.docid: 122828
negative_passages.text: Proof that TREE(n) where n >= 3 is finite?
negative_passages.docid: 10910
negative_passages.text: How many edges does an undirected tree with $n$ nodes have?
negative_passages.docid: 158802
negative_passages.text: Graph theory and tree company