Blowing up Dirac's theorem

Read full text
Authors: Richard Lang, Nicolás Sanhueza‐Matamala
Cited by: 0
References: 11

Abstract

Abstract We show that every graph on vertices with is spanned by a complete blow‐up of a cycle with clusters of nearly uniform size . The proof is based on a recently introduced approach for finding vertex‐spanning substructures via blow‐up covers.

Fields of Study & Subjects

Limits and Structures in Graph Theory Advanced Graph Theory Research Advanced Combinatorial Mathematics

Publication details

Journal / source
Bulletin of the London Mathematical Society
Volume
58
Issue
1
Publication date
1 January 2026
Language
EN