Results 1 to 3 of 3

Math Help - graph

  1. #1
    Newbie
    Joined
    Dec 2010
    Posts
    15

    graph

    Hi!

    I have d-regular bipartite graph with two sets, each link has one edge in one set and another edge in second set. Graph has preference relations.

    How can I prove that graph contains stable matching cardinality at least d?


    Thank you in advance!
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Senior Member
    Joined
    Dec 2010
    Posts
    470
    The Gale-Shapley algorithm is a well known solution to this problem. You should look it up
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Newbie
    Joined
    Dec 2010
    Posts
    15
    On cases I know how to do this, but how can I prove this in general?
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Graph Theory / Chromatic Number of a Complete Graph
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: November 15th 2011, 10:59 AM
  2. Replies: 7
    Last Post: August 5th 2011, 02:30 PM
  3. (Graph Theory)Prove that graph X is a tree.
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: August 1st 2011, 04:30 AM
  4. Replies: 0
    Last Post: September 25th 2010, 06:59 AM
  5. Replies: 1
    Last Post: February 15th 2009, 06:35 AM

Search Tags


/mathhelpforum @mathhelpforum