First steps in combinatorial optimization on graphons: matchings
type: Item
instance of: scholarly article
title: First steps in combinatorial optimization on graphons: matchings
zbMATH Open document ID: 1378.05164
author: Martin Doležal
author: Jan Hladký
author: Ping Hu
author: Diana Piguet
publication date: 2018-01-18T00:00:00Z
full work available at URL: WRAP-first-steps-combinatorial-optimization-graphons-matchings-Hu-2017 (1).pdf
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6827197
zbMATH Keywords: graphon
zbMATH Keywords: graph limits
zbMATH Keywords: matching
zbMATH Keywords: combinatorial optimization
MaRDI profile type: Publication
OpenAlex ID: W2744054501
cites work: Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
cites work: Matching polytons
cites work: Komlós's tiling theorem via graphon covers
cites work: Tilings in graphons
cites work: Tiling Turán theorems
cites work: Limits of dense graph sequences
DOI: 10.1016/J.ENDM.2017.06.060
description: scientific article; zbMATH DE number 6827197