First steps in combinatorial optimization on graphons: matchings

DOI10.1016/j.endm.2017.06.060zbMath1378.05164OpenAlexW2744054501MaRDI QIDQ1689941

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

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

graphoncombinatorial optimizationmatchinggraph limits

Mathematics Subject Classification ID

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

Related Items (2)

Tilings in graphons ⋮ Matching polytons

Cites Work

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

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