complete bipartite subgraph of a graph

**wik_chick88** · September 6th 2011, 04:47 PM

(a) prove that every graph of order $n \geq 4$ and size $n + 1$ contains $K_{1,3}$ as a subgraph

(b) describe the graphs of order $n \geq 4$ and size $n$ that do not contain $K_{1,3}$ as a subgraph

**Plato** · September 6th 2011, 05:13 PM

Originally Posted by wik_chick88

(a) prove that every graph of order $n \geq 4$ and size $n + 1$ contains $K_{1,3}$ as a subgraph

(b) describe the graphs of order $n \geq 4$ and size $n$ that do not contain $K_{1,3}$ as a subgraph

I see that you have some other postings, more than 170.
You should understand by now that this is not a homework service nor is it a tutorial service. Please either post some of your own work on these problems or explain what you do not understand about the question.

Thread: complete bipartite subgraph of a graph

LinkBack

Thread Tools

Display

complete bipartite subgraph of a graph

Re: complete bipartite subgraph of a graph

Similar Math Help Forum Discussions

Graph theory, bipartite Graph

Spanning Tree's in the Complete Bipartite Graph

Bipartite Graph

Complete Bipartite Graphs

Bipartite Simple Graph

Search Tags