Spanning clique subdivisions in pseudorandom graphs
Matías Pavez-Signé, Hyunwoo Lee, Teo Petrov
Source record
Source: Crossref
Published: Jul 6, 2026
DOI: 10.1017/s0963548326100480
Open original source ↗Source abstract
Abstract In this paper, we study the appearance of a spanning subdivision of a clique in graphs satisfying certain pseudorandom conditions. Specifically, we show the following results. (i) There are constants upper C greater than 0 C > 0 and c element of left parenthesis 0 comma 1 right bracket c ∈ ( 0 , 1 ] such that, whenever d divided by lamda greater than or equals upper C d / λ ≥ C , every left parenthesis n comma d comma lamda right parenthesis ( n , d , λ ) -graph contains a spanning subdivision of upper K Subscript t K t for all 2 less than or equals t less than or equals min left brace c d comma c StartRoot StartFraction n Over log n EndFraction EndRoot right brace 2 ≤ t ≤ min { c d , c n log n } . (ii) There are constants upper C greater than 0 C > 0 and c element of left parenthesis 0 comma 1 right bracket c ∈ ( 0 , 1 ] such that, whenever d divided by lamda greater than or equals upper C log cubed n d / λ ≥ C log 3 n , every left parenthesis n comma d comma lamda right parenthesis ( n , d , λ ) -graph contains a spanning nearly balanced subdivision of upper K Subscript t K t for all 2 less than or equals t less than or equals min left brace c d comma c StartRoot StartFraction n Over log cubed n EndFraction EndRoot right brace 2 ≤ t ≤ min { c d , c n log 3 n } . (iii) For every mu greater than 0 μ > 0 , there are constants c comma epsilon element of left parenthesis 0 comma 1 right bracket c , ε ∈ ( 0 , 1 ] and n 0 element of double struck upper N n 0 ∈ N such that, whenever n greater than or equals n 0 n ≥ n 0 , every n n -vertex graph with minimum degree at least mu n μ n and no bipartite holes of size epsilon n ε n contains a spanning nearly balanced subdivision of upper K Subscript t K t for all 2 less than or equals t less than or equals c StartRoot n EndRoot 2 ≤ t ≤ c n .
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.