Minors in lifts of graphs

Yotam Drier*, Nathan Linial

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

We study here lifts and random lifts of graphs, as defined by Amit and Linial (Combinatorica 22 (2002), 1-18). We consider the Hadwiger number η and the Hajós number σ of ℓ-lifts of Kn and analyze their extremal as well as their typical values (that is, for random lifts). When ℓ = 2, we show that n/2 ≤ η ≤ n, and random lifts achieve the lower bound (as n → ∞). For bigger values of ℓ, we show Ω(n/√log n) ≤ η ≤ n √ℓ. We do not know how tight these bounds are, and in fact, the most interesting question that remains open is whether it is possible for η to be o(n). When ℓ ≤ O(log n), almost every ℓ-lift of Kn satisfies η = ⊖(n) and for Ω(log n) ≤ ℓ ≤ ≤ n1/3-ε, almost surely η = ⊖(n√ℓ/√log n). For bigger values of ℓ, Ω(n√ℓ/√log ℓ) ≤ η ≤ n√ℓ almost always. The Hajós number satisfies Ω(√n) ≤ σ ≤ n, and random lifts achieve the lower bound for bounded ℓ and approach the upper bound when ℓ grows.

Original languageAmerican English
Pages (from-to)208-225
Number of pages18
JournalRandom Structures and Algorithms
Volume29
Issue number2
DOIs
StatePublished - Sep 2006

Fingerprint

Dive into the research topics of 'Minors in lifts of graphs'. Together they form a unique fingerprint.

Cite this