Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777094 | Electronic Notes in Discrete Mathematics | 2017 | 7 Pages |
Abstract
Much of discrete optimization concerns problems whose underlying structures are graphs. Here, we translate the theory around the maximum matching problem to the setting of graphons. We study continuity properties of the thus defined matching ratio, limit versions of matching polytopes and vertex cover polytopes, and deduce a version of the LP duality for the problem of maximum fractional matching in the graphon setting.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Martin Doležal, Jan Hladký, Ping Hu, Diana Piguet,