First steps in combinatorial optimization on graphons: matchings

DOI10.1016/J.ENDM.2017.06.060MaRDI QIDQ1689941zbMATH OpenOpenAlexFDO

Authors Martin Doležal, Jan Hladký, Ping Hu, Diana Piguet

Publication date 18 January 2018

Full work available at URL http://wrap.warwick.ac.uk/90966/7/WRAP-first-steps-combinatorial-optimization-graphons-matchings-Hu-2017%20%281%29.pdf

zbMATH Keywords

combinatorial optimizationmatchinggraphongraph limits

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Matching polytons
• Matching theory
• Matchings on infinite graphs
• Matching, matroids, and extensions
• scientific article; zbMATH DE number 2042286

Cites work

• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Komlós's tiling theorem via graphon covers
• Limits of dense graph sequences
• Matching polytons
• Tiling Turán theorems
• Tilings in graphons

Cited in

(2)

• Tilings in graphons
• Matching polytons

This page was built for publication: First steps in combinatorial optimization on graphons: matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689941)