A median-type condition for graph tiling

DOI10.1016/j.endm.2017.07.062zbMath1378.05103arXiv1805.03507OpenAlexW2962694558WikidataQ128736020 ScholiaQ128736020MaRDI QIDQ5915833

Diana Piguet, Maria Saumell

Publication date: 18 January 2018

Published in: Electronic Notes in Discrete Mathematics, European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

regularity lemmachromatic numbercritical chromatic numbergraph tilingextremal graph theoryminimum degree condition\(H\)-matchingLP-duality\(H\)-factor

Mathematics Subject Classification ID

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

Related Items (2)

A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs ⋮ A Degree Sequence Komlós Theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A degree sequence Hajnal-Szemerédi theorem
• The extremal function for partial bipartite tilings
• Tiling Turán theorems
• The minimum degree threshold for perfect graph packings
• Tilings in graphons
• Matching polytons
• Asymptotic multipartite version of the Alon-Yuster theorem
• On maximal paths and circuits of graphs
• A Density Corrádi–Hajnal Theorem
• Komlós's tiling theorem via graphon covers
• On the structure of linear graphs

This page was built for publication: A median-type condition for graph tiling