Boxicity, poset dimension, and excluded minors
Combinatorics
2019-01-21 v4
Abstract
In this short note, we relate the boxicity of graphs (and the dimension of posets) with their generalized coloring parameters. In particular, together with known estimates, our results imply that any graph with no -minor can be represented as the intersection of interval graphs (improving the previous bound of ), and as the intersection of circular-arc graphs.
Keywords
Cite
@article{arxiv.1804.00850,
title = {Boxicity, poset dimension, and excluded minors},
author = {Louis Esperet and Veit Wiechert},
journal= {arXiv preprint arXiv:1804.00850},
year = {2019}
}
Comments
9 pages, 3 figures - final version