Komlós's tiling theorem via graphon covers

DOI10.1002/jgt.22365zbMath1414.05158arXiv1607.08415OpenAlexW3102215935MaRDI QIDQ5379813

Ping Hu, Jan Hladký, Diana Piguet

Publication date: 14 June 2019

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.08415

zbMATH Keywords

graphongraph tilingextremal graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items (9)

Triangles in randomly perturbed graphs ⋮ Linear-sized independent sets in random cographs and increasing subsequences in separable permutations ⋮ On a question of Vera T. Sós about size forcing of graphons ⋮ Independent sets, cliques, and colorings in graphons ⋮ First steps in combinatorial optimization on graphons: matchings ⋮ Relating the cut distance and the weak* topology for graphons ⋮ Tilings in graphons ⋮ Matching polytons ⋮ A median-type condition for graph tiling

This page was built for publication: Komlós's tiling theorem via graphon covers