Bounded-Degree Graphs have Arbitrarily Large Queue-Number
David R. Wood
Abstract
It is proved that there exist graphs of bounded degree with arbitrarily large queue-number. In particular, for all Δ≥3 and for all sufficiently large n, there is a simple Δ-regular n-vertex graph with queue-number at least cΔn1/2-1/Δ for some absolute constant c.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.