Skip to content

Discrete Thoughts

by Zilin Jiang

  • Previous Courses
    • 21-300 & 21-600 Fall 2011
    • 21-355 Spring 2012
    • 21-120 Fall 2012
    • 21-127 Spring 2013
    • 21-259 Fall 2013
    • 21-240 Spring 2014
    • 21-122 Fall 2014
    • 21-257 Fall 2015
    • 104018 Spring 2017
    • 104131 Winter 2017
    • 18.204 Fall 2018
    • 18.204 Spring 2019
    • 18.204 Fall 2019
    • 18.204 Spring 2020
    • 18.211 Fall 2020
    • CSE 598 Spring 2021
    • MAT 415 / MAT 512 Fall 2021
    • MAT 598 Spring 2022
  • Math Olympiad
    • MOSP 2014
    • MOSP 2015
    • MOSP 2016
    • CMOSP 2017
  • Shells on Seashore
  • Into Darkness

Category: Mathematics

Hall's Theorem

In 1935, the mathematician Philip Hall discovered a criteria of a perfect matching on a bipartite graph, known as Hall’s theorem, aka marriage theorem. Considering two sets of vertices, denoted as and . Edges are connected between and for some pairs of . Here, we admit multiple edges between two vertices. This graph, named as… Continue reading Hall's Theorem

Published April 30, 2010
Categorized as Mathematics Tagged Graph Theory, Hall's Theorem, Perfect Matching

Posts navigation

Newer posts Page 1 … Page 4

Recent Posts

  • On the Stirling numbers of the first kind
  • On Gromov’s theorem on groups of polynomial growth
  • On the basis exchange property
  • Minimal Distance to Pi
  • Shalom to Ning

Recent Comments

  • sam on 建筑学中的拓扑学
  • Ricardo on A Short Proof of the Nash-Williams' Partition Theorem
  • jd on Mathematical Abbreviations
  • Roy on A Probabilistic Proof of Isoperimetric Inequality
  • clan on A Probabilistic Proof of Isoperimetric Inequality

Meta

  • Register
  • Log in
  • Entries feed
  • Comments feed
  • WordPress.org
Discrete Thoughts
Proudly powered by WordPress.