Results 1 to 2 of 2

Math Help - complete bipartite subgraph of a graph

  1. #1
    Member
    Joined
    Apr 2008
    Posts
    204

    complete bipartite subgraph of a graph

    (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
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Aug 2006
    Posts
    18,669
    Thanks
    1618
    Awards
    1

    Re: complete bipartite subgraph of a graph

    Quote Originally Posted by wik_chick88 View Post
    (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.
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Graph theory, bipartite Graph
    Posted in the Math Topics Forum
    Replies: 2
    Last Post: March 10th 2012, 05:47 AM
  2. Spanning Tree's in the Complete Bipartite Graph
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: March 26th 2011, 03:33 AM
  3. Bipartite Graph
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: October 14th 2010, 02:37 AM
  4. Complete Bipartite Graphs
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: March 29th 2010, 12:27 PM
  5. Bipartite Simple Graph
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: May 3rd 2009, 12:37 PM

Search Tags


/mathhelpforum @mathhelpforum