FAQ

Hall's marriage theorem

Known as: Hall marriage theorem, Set of distinct representatives, Marriage Theorem 
Hall's marriage theorem, or simply Hall's theorem, proved by Philip Hall (), is a theorem with two equivalent formulations: * The combinatorial… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2017
051019772017

Related topics

Related topics

13 relations
Clos networkGraph factorizationGraph theoryKÅ‘nig's theorem
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Hall's marriage theorem
Matching
Graph theory
Neighbourhood
Saturation
Graph factorization

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
On the strength of marriage theorems and uniformity
Kierstead showed that every computable marriage problem has a computable matching under the assumption of computable expanding… (More)
  • table 1
  • table 2
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Multichannel Opportunistic Carrier Sensing for Stable Channel Access Control in Cognitive Radio Systems
In this paper we propose to use the well known game theoretic Gale-Shapley stable marriage theorem from game theory as a basis… (More)
  • table I
  • table III
  • figure 1
  • table V
  • table VI
Is this relevant?
2011
2011
Proof Pearl: The Marriage Theorem
We describe two formal proofs of the finite version of Hall’s Marriage Theorem performed with the proof assistant Isabelle/HOL… (More)
Is this relevant?
2010
2010
Hall's Marriage Theorem
A proof of Hall’s Marriage Theorem due to Halmos and Vaughan [1]. theory Marriage imports Main 
Is this relevant?
2008
2008
Commuting conjugacy classes: An application of Hall’s Marriage Theorem to Group Theory
Let G be a finite group. Define a relation ∼ on the conjugacy classes of G by setting C ∼ D if there are representatives c ∈ C… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
A Fixed-Point Approach to Stable Matchings and Some Applications
We describe a fixed-point based approach to the theory of bipartite stable matchings. By this, we provide a common framework that… (More)
Is this relevant?
2003
2003
A new look at multisets
We consider a new way of looking at multisets, involving linear rather than multiplicative notation and operations which mirror… (More)
Is this relevant?
2003
2003
Perfect matchings in random graphs with prescribed minimal degree
1 I n t r o d u c t i o n To quote from Lovgsz [12], "the problem of the existence of 1factors (perfect matchings), the solution… (More)
Is this relevant?
2001
2001
Hall’s Marriage Theorem and Hamiltonian Cycles in Graphs
If S is a set of vertices in a graph G, let d(S) be the number of vertices in G adjacent to at least one member of S. The… (More)
  • figure 1
  • figure 2
Is this relevant?
2000
2000
Short Proof of the Gallai-Edmonds Structure Theorem
We derive the Gallai-Edmonds Structure Theorem from Hall’s Theorem. Introduction and Definitions In 1971, Anderson [1] gave a… (More)
Is this relevant?