Hall's marriage theorem, or simply Hall's theorem, proved by Philip Hall (), is a theorem with two equivalent formulations: * The combinatorialâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- Makoto Fujiwara, Kojiro Higuchi, Takayuki Kihara
- Math. Log. Q.
- 2014

Kierstead showed that every computable marriage problem has a computable matching under the assumption of computable expandingâ€¦Â (More)

Is this relevant?

Highly Cited

2012

Highly Cited

2012

- Amir Leshem, Ephraim Zehavi, Yoav Yaffe
- IEEE Journal on Selected Areas in Communications
- 2012

In this paper we propose to use the well known game theoretic Gale-Shapley stable marriage theorem from game theory as a basisâ€¦Â (More)

Is this relevant?

2011

2011

- Dongchen Jiang, Tobias Nipkow
- CPP
- 2011

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

- Dongchen Jiang, Tobias Nipkow
- Archive of Formal Proofs
- 2010

A proof of Hallâ€™s Marriage Theorem due to Halmos and Vaughan [1]. theory Marriage imports MainÂ

Is this relevant?

2008

2008

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

- TamÃ¡s Fleiner
- Math. Oper. Res.
- 2003

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

- N. J. Wildberger
- 2003

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

- Alan M. Frieze, Boris Pittel
- SODA
- 2003

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

- Lionel Levine
- 2001

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)

Is this relevant?

2000

2000

We derive the Gallai-Edmonds Structure Theorem from Hallâ€™s Theorem. Introduction and Definitions In 1971, Anderson [1] gave aâ€¦Â (More)

Is this relevant?