DeepAI AI Chat
Log In Sign Up

On a Generalization of the Marriage Problem

by   Jonathan Lenchner, et al.

We present a generalization of the marriage problem underlying Hall's famous Marriage Theorem to what we call the Symmetric Marriage Problem, a problem that can be thought of as a special case of Maximal Weighted Bipartite Matching. We show that there is a solution to the Symmetric Marriage Problem if and only if a variation on Hall's Condition holds on each of the bipartitions. We prove both finite and infinite versions of this result and provide applications.


page 1

page 2

page 3

page 4


Rational points on complete symmetric hypersurfaces over finite fields

For any affine hypersurface defined by a complete symmetric polynomial i...

Dichotomy Result on 3-Regular Bipartite Non-negative Functions

We prove a complexity dichotomy theorem for a class of Holant problems o...

Short rainbow cycles in sparse graphs

Let G be a simple n-vertex graph and c be a colouring of E(G) with n col...

Online Matching in a Ride-Sharing Platform

We propose a formal graph-theoretic model for studying the problem of ma...

An Investigation of the Recoverable Robust Assignment Problem

We investigate the so-called recoverable robust assignment problem on ba...

Optimal tiling of the Euclidean space using symmetric bodies

What is the least surface area of a symmetric body B whose ℤ^n translati...

How many matchings cover the nodes of a graph?

Given an undirected graph, are there k matchings whose union covers all ...