query: how to use the pigeon hole principle on a graph problem?
positive_passages.docid: 906
positive_passages.text: Pigeonhole Principle Question - Group of 6 people, do 3 either know each other or not?
negative_passages.docid: 56092
negative_passages.text: What is complexity of this max-edge subgraph problem?
negative_passages.docid: 51002
negative_passages.text: Regular graph (Homework)
negative_passages.docid: 116932
negative_passages.text: Proving a simple graph is a connected graph
negative_passages.docid: 94923
negative_passages.text: Using the Pigeonhole Principle to show that $2$ of any $n+1$ numbers from $\{1,2,\ldots,2n\}$ sum to $2n+1$
negative_passages.docid: 99806
negative_passages.text: Given an undirected Graph
negative_passages.docid: 1453
negative_passages.text: Prove that the graph is connected
negative_passages.docid: 150324
negative_passages.text: Pigeonhole principle: prove that any set of $n+1$ integers from $\{1,2,...,2n\}$ has two consecutive integers differ by one.
negative_passages.docid: 29887
negative_passages.text: Pigeon Hole Principle Problem I'm kind of lost for how to go about this.
negative_passages.docid: 68882
negative_passages.text: Path to Combinatorics Problem [$1.11$]
negative_passages.docid: 128034
negative_passages.text: Problem on Extremal Graphs: three independent paths
negative_passages.docid: 101804
negative_passages.text: Problem concerning the use of Pigeonhole (Box) principle
negative_passages.docid: 49703
negative_passages.text: Analogue of closed graph theorem
negative_passages.docid: 99900
negative_passages.text: Pigeonhole principle application
negative_passages.docid: 138465
negative_passages.text: Graph Coloring and Complete Graph
negative_passages.docid: 49879
negative_passages.text: A bipartite graph with a perfect matching has a vertex with each edge contained in a perfect matching
negative_passages.docid: 27373
negative_passages.text: Graph Proof by induction.