Box-Delaunay graphs of large chromatic number
István Tomon
Abstract
For every n, we construct a 2-dimensional n-element poset whose Hasse diagram has independence number n(-Ω( n)), and consequently, chromatic number (Ω( n)). This also yields an n-point planar set whose box-Delaunay graph satisfies the same bounds.
Create a lesson
Related papers
Canonical-row Chern flow on Bott--Samelson towers: realizable-volume models for Schubert, Grothendieck, and Lascoux polynomials
Khai-Hoan Nguyen-Dang, Zhenpeng Wang
Degeneracy bounds, stability, and a sharp gap for B-colorings
Xiaoxue Hu, Jiangxu Kong, Yiqiao Wang
Duals of algebraic matroids need not be algebraic
Matt Larson, Tuong Le
Most (0,1)-polytopes are not normal
Santiago Morales
Bounded Twin-Width Tournaments are -Bounded
Chaoliang Tang, Junchi Zhang
An Affine Semigroup from Orbifold Boundary Conditions: cut, phylogenetic and hierarchical models in the unit-weight sector, and weighted configurations beyond them
Carles Marín