The following pages link to The Marriage Problem (Q5792047):
Displaying 49 items.
- Integer and fractional security in graphs (Q442229) (← links)
- The classification of simple separable unital \(\mathcal{Z}\)-stable locally ASH algebras (Q527394) (← links)
- Similarity classification and properties of some extended holomorphic curves (Q621789) (← links)
- The combinatorics of N. G. de Bruijn (Q740470) (← links)
- \((F, I)\)-security in graphs (Q741750) (← links)
- Cancellation laws for surjective cardinals (Q760421) (← links)
- Configurations of flags in orbits of real forms (Q776200) (← links)
- Distributions of random sets and random selections (Q797202) (← links)
- Consistent voting systems with a continuum of voters (Q857972) (← links)
- Extending Hall's theorem into list colorings: a partial history (Q925374) (← links)
- On attainable distribution and classification vectors (Q1110219) (← links)
- Representing matrices (Q1146676) (← links)
- Fourier transforms of nilpotently supported invariant functions on a simple Lie algebra over a finite field (Q1169570) (← links)
- Marriage in denumerable societies (Q1219283) (← links)
- Score vectors of tournaments (Q1226500) (← links)
- Estimating norms in \(C^*\)-algebras of discrete groups (Q1229966) (← links)
- Satisfiability on hypergraphs (Q1313082) (← links)
- Classification of homomorphisms from \(C(X)\) to simple \(C^*\)-algebras of real rank zero (Q1578858) (← links)
- Equally distributed correspondences (Q1846518) (← links)
- A syntactical proof of the Marriage Lemma. (Q1853584) (← links)
- Pure strategies in games with private information (Q1906064) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- No easy puzzles: hardness results for jigsaw puzzles (Q2346997) (← links)
- Systems of distant representatives in Euclidean space (Q2347967) (← links)
- Applications of Menger's graph theorem (Q2527630) (← links)
- Bernoulli shifts with the same entropy are isomorphic (Q2539896) (← links)
- Hall's criterion as a 'self-refining' result (Q2540556) (← links)
- On fully indecomposable matrices (Q2550954) (← links)
- On a distribution problem in finite and countable sets (Q2560404) (← links)
- A proof of Dilworth's decomposition theorem for partially ordered sets (Q2625477) (← links)
- Maximal-\(\Gamma\)-prime Graphen (Q2625678) (← links)
- Hall’s theorem revisited (Q2723513) (← links)
- On classical and modern marriage problems (Q3033766) (← links)
- List multicoloring problems involving the k-fold Hall numbers (Q3055924) (← links)
- Proof Pearl: The Marriage Theorem (Q3100219) (← links)
- Quasi-actions on trees II: Finite depth Bass-Serre trees (Q3112535) (← links)
- Matrices of zeros and ones (Q3276702) (← links)
- Tracial Rokhlin property for automorphisms on simple -algebras (Q3528759) (← links)
- Theorems on sets not belonging to algebras (Q4680996) (← links)
- Edge list multicoloring trees: An extension of Hall's theorem (Q4800403) (← links)
- Approximately diagonalizing matrices over <i>C</i> ( <i>Y</i> ) (Q4907485) (← links)
- Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs (Q4948749) (← links)
- R. Thompson’s group and the amenability problem (Q5088175) (← links)
- A decomposition theorem for real rank zero inductive limits of 1-dimensional non-commutative CW complexes (Q5377569) (← links)
- Approximate unitary equivalence in simple $C^{*}$-algebras of tracial rank one (Q5389418) (← links)
- On a property of families of sets (Q5599149) (← links)
- (Q5646944) (← links)
- Selectionable distributions for a random set (Q5750023) (← links)
- Systems of representatives (Q5920823) (← links)
