Commit 9408b366 by Zdenek Dvorak

### Beginning of the writeup.

parent 805aa7cf
 \documentclass[10pt]{article} \usepackage{amsthm} \usepackage{amsfonts} \usepackage{amsmath} \usepackage{amssymb} \usepackage{colonequals} \usepackage{epsfig} \usepackage{url} \newcommand{\GG}{{\cal G}} \newcommand{\CC}{{\cal C}} \newcommand{\OO}{{\cal O}} \newcommand{\PP}{{\cal P}} \newcommand{\RR}{{\cal R}} \newcommand{\col}{\text{col}} \newcommand{\vol}{\text{vol}} \newcommand{\eps}{\varepsilon} \newcommand{\mc}[1]{\mathcal{#1}} \newcommand{\mf}[1]{\mathfrak{#1}} \newcommand{\bb}[1]{\mathbb{#1}} \newcommand{\brm}[1]{\operatorname{#1}} \newcommand{\cbdim}{\brm{dim}_{cb}} %%%%% \newtheorem{theorem}{Theorem} \newtheorem{corollary}[theorem]{Corollary} \newtheorem{lemma}[theorem]{Lemma} \newtheorem{example}[theorem]{Example} \newtheorem{proposition}[theorem]{Proposition} \newtheorem{observation}[theorem]{Observation} \newtheorem{question}[theorem]{Question} \title{On comparable box dimension} \author{Zden\v{e}k Dvo\v{r}\'ak\thanks{Computer Science Institute, Charles University, Prague, Czech Republic. E-mail: {\tt rakdver@iuuk.mff.cuni.cz}. Supported by the ERC-CZ project LL2005 (Algorithms and complexity within and beyond bounded expansion) of the Ministry of Education of Czech Republic.}\and Daniel Gon\c{c}alves\thanks{...} Abhiruk Lahiri\thanks{...}\and Jane Tan\thanks{...}\and Torsten Ueckerdt\thanks{Karlsruhe Institute of Technology. E-mail: {\tt torsten.ueckerdt@kit.edu}}} \date{} \begin{document} \maketitle \begin{abstract} The comparable box dimension of a graph $G$ is the minimum integer $d$ such that $G$ can be represented as a touching graph of comparable boxes in $\mathbb{R}^d$ (two boxes are comparable if one of them is a subset of a translation of the other one). We show that proper minor-closed classes have bounded comparable box dimension and explore further properties of this notion. \end{abstract} \section{Introduction} For a system $\OO$ of subsets of $\mathbb{R}^d$, we say that a graph $G$ is a \emph{touching graph of objects from $\OO$} if there exists a function $f:V(G)\to \OO$ (called the \emph{touching representation by objects from $\OO$}) such that for distinct $u,v\in V(G)$, the interiors of $f(u)$ and $f(v)$ are disjoint and $f(u)\cap f(v)\neq\emptyset$ if and only if $uv\in E(G)$. Famously, Koebe~\cite{koebe} proved that a graph is planar if and only if it is a touching graph of balls in $\mathbb{R}^2$. This result motivated a number of strenthenings and variations~\cite{...}; most relevantly for us, every planar graph is a touching graph of cubes in $\mathbb{R}^3$~\cite{felsner2011contact}. An attractive feature of touching representation is that it makes it possible to represent graph classes that are sparse (e.g., planar graphs, or more generally, graph classes with bounded expansion theory~\cite{nesbook}), whereas in a general intersection representation, the represented class always includes arbitrarily large cliques. Of course, whether the class of touching graph of objects from $\OO$ is sparse or not depends on the system $\OO$. For example, all complete bipartite graphs $K_{n,m}$ are touching graphs of axis-aligned boxes in $\mathbb{R}^d$, where the vertices in one part are represented by $m\times 1\times 1$ boxes and the vertices of the other part are represented by $1\times n\times 1$ boxes (a \emph{box} is the cartesian product of intervals of non-zero length). Dvo\v{r}\'ak, McCarty and Norin~\cite{subconvex} noticed that this issue disappears if we forbid such a combination of long and wide boxes: Two boxes are \emph{comparable} if a translation of one of them is a subset of the other one. A \emph{touching representation by comparable boxes} of a graph $G$ is a touching representation $f$ by boxes such that for every $u,v\in V(G)$, the boxes $f(u)$ and $f(v)$ are comparable. For a graph $G$, let the \emph{comparable box dimension} $\cbdim(G)$ of $G$ be the smallest integer $d$ such that $G$ has a touching representation by comparable boxes in $\mathbb{R}^d$. For a class $\GG$ of graphs, let $\cbdim(\GG)=\sup\{\cbdim(G):G\in\GG\}$; note that $\cbdim(\GG)=\infty$ if the comparable box dimension of graphs in $\GG$ is not bounded. Dvo\v{r}\'ak, McCarty and Norin~\cite{subconvex} proved some basic properties of this notion. In particular, they proved that if a class $\GG$ has finite comparable box dimension, then it has polynomial strong coloring numbers, which implies that $\GG$ has strongly sublinear separators. They also provided an example showing that for any function $h$, the class of graphs with strong coloring numbers bounded by $h$ has infinite comparable box dimension. Dvo\v{r}\'ak et al.~\cite{wcolig} proved that graphs of comparable box dimension $3$ have exponential weak coloring number, giving the first natural graph class with olynomial strong coloring numbers and superpolynomial weak coloring numbers (the previous example is obtained by subdividing edges of every graph suitably many times~\cite{covcol}). We show that the comparable box dimension behaves well under the operations of addition of apex vertices, clique-sums, and taking subgraphs. Together with known results on product structure~\cite{DJM+}, this implies the main result of this paper. \begin{theorem}\label{thm-minor} The comparable box dimension of every proper minor-closed class of graphs is finite. \end{theorem} Additionally, we show that classes of graphs with finite comparable box dimension are fractionally treewidth-fragile. This gives arbitrarily precise approximation algorithms for alll monotone maximization problems that are expressible in terms of distances between the solution vertices and tractable on graphs of bounded treewidth~\cite{distapx} or expressible in the first-order logic~\cite{logapx}. \section{Operations} Let us start with a simple lemma saying that addition of a vertex increases the comparable box dimension by at most one. \begin{lemma}\label{lemma-apex} For any graph $G$ and $v\in V(G)$, we have $\cbdim(G)\le \cbdim(G-v)+1$. \end{lemma} \begin{proof} Let $f$ be a comparable box representation of $G-v$ in $\mathbb{R}^d$, where $d=\cbdim(G-v)$. For each $u\in V(G)\setminus\{v\}$, let $h(u)=[0,1]\times f(u)$ if $uv\in E(G)$ and $h(u)=[1/2,3/2]\times f(u)$ if $uv\not\in E(G)$. Let $h(v)=[-1,0]\times [-M,M] \times \cdots \times [-M,M]$, where $M$ is chosen large enough so that $f(u)\subseteq [-M,M] \times \cdots \times [-M,M]$ for every $u\in V(G)\setminus\{v\}$. Then $h$ is a comparable box representation of $G$ in $\mathbb{R}^{d+1}$. \end{proof} Next, let us deal with clique-sums. A \emph{clique-sum} of two graphs $G_1$ and $G_2$ is obtained from their disjoint union by identifying vertices of a clique in $G_1$ and a clique of the same size in $G_2$ and possibly deleting some of the edges of the resulting clique. The main issue to overcome in obtaining a representation for a clique-sum is that the representations of $G_1$ and $G_2$ can be degenerate''. Consider e.g. the case that $G_1$ is represented by unit squares arrangef in a grid; in this case, there is no space to attach $G_2$ at the cliques formed by four squares intersecting in a single corner. This can be avoided by increasing the dimension, but we need to be careful so that the dimension stays bounded even after, motivating the following definition. For a box $B=I_1\times \cdot\times I_d$ and $i\in\{1,\ldots,d\}$ let $B[i]$ denote the interval $I_i$. Let $B_1$, \ldots, $B_k$ be pairwise touching boxes in $\mathbb{R}^d$. A box $B$ \emph{touches $B_1$, \ldots, $B_k$ generically} if there exist distinct $i_1,\ldots, i_k\in\{1,\ldots, d\}$ such that for $j=1,\ldots, k$, \begin{itemize} \item $B[i_j]\cap B_j[i_j]$ consists of a single point, and \item for every $i\in\{1,\ldots,d\}\setminus \{i_j\}$, $B[i]\cap B_j[i]$ is a non-empty interval of non-zero length. \end{itemize} A clique $K$ in a touching box representation $f$ of a graph $G$ in $\mathbb{R}^d$ is \emph{exposed} if there exists a box $B$ such that \begin{itemize} \item the interior of $B$ is disjoint from $f(v)$ for every $v\in V(G)$, \item $B$ touches the boxes $\{f(u):u\in K\}$ generically, and \item there exists $i\in\{1,\ldots,d\}$ such that $B[i]\subseteq f(u)[i]$ for every $u\in K$. \end{itemize} The representation is \emph{exposed} if all cliques are exposed. \begin{lemma}\label{lemma-expose} Every graph $G$ has an exposed comparable box representation in $\mathbb{R}^{\chi(G)}$. \end{lemma} \begin{proof} ... \end{proof} Note that the chromatic number of $G$ is at most exponential in the comparable box dimension; this follows from~\cite{subconvex} and we include the argument to make the dependence clear. \begin{lemma}\label{lemma-chrom} If $G$ has a comparable box representation $f$ in $\mathbb{R}^d$, then $G$ is $3^d$-colorable. \end{lemma} \begin{proof} We actually show that $G$ is $(3^d-1)$-degenerate. Since every induced subgraph of $G$ also has a comparable box representation in $\mathbb{R}^d$, it suffices to show that the minimum degree of $G$ is less than $3^d$. Let $v$ be a vertex of $G$ such that $f(v)$ has the smallest volume. For every neighbor $u$ of $v$, there exists a translation $B_u$ of $f(v)$ such that $B_u\subseteq f(u)$ and $B_u$ touches $f(v)$. Note that $f(v)\cup \bigcup_{u\in N(v)} B_u$ is a union of internally disjoint translations of $f(v)$ contained in a box obtained from $f(v)$ by scaling it by a factor of three, and thus $1+|N(v)|\le 3^d$. \end{proof} \section{Exploiting the product structure} \bibliographystyle{siam} \bibliography{data} \end{document}
data.bib 0 → 100644
 @article{catlin, author={P. A. Catlin}, title={A bound on the chromatic number of a graph}, journal={Discrete Math.}, volume={22}, year=1978, pages={81--83} } @article{hajos, author={G. Haj\"os}, title={{\"Uber eine konstraktion nicht $n$-farbbarer graphen}}, journal={Wiss. Z. MartinLuther Univ. Halle-Wittenberg Math. Naturwiss. Reihe}, number={10}, year={1961}, pages={116--117} } @article{dirac, author={G.A. Dirac}, title={A property of 4-chromatic graphs and some remarks on critical graphs}, journal={Journal of London Math Society}, volume=27, year={1952}, pages={85--92} } @article{diracsh, author={G. A. Dirac}, title={Short proof of a map colour theorem}, journal={Can. J. Math.}, volume=9, year=1957, pages="225--226" } @article{acyc, author={O.V. Borodin}, year=1979, title={On acyclic colorings of planar graphs}, journal={Discrete Mathematics}, volume=25, pages="211--236" } @article{dens65, author = {O.V. Borodin and S. G. Hartke and A. O. Ivanova and A. V. Kostochka and D. B. West}, title = {Circular (5,2)-coloring of sparse graphs}, journal = {Sib. Elektron. Mat. Izv.}, volume = 5, year = 2008, pages = "417--426"} @inproceedings{plotkin, title={Shallow excluded minors and improved graph decompositions}, author={Plotkin, Serge and Rao, Satish and Smith, Warren D}, booktitle={Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms}, pages={462--470}, year={1994}, organization={Society for Industrial and Applied Mathematics} } @article{zhusurvey1, title = "Circular chromatic number: a survey", journal = "Discrete Mathematics ", volume = "229", number = "1-3", pages = "371--410", year = "2001", author = {Zhu, Xuding}, } @incollection{zhusurvey2, title={Recent developments in circular colouring of graphs}, author={Zhu, Xuding}, booktitle={Topics in discrete mathematics}, pages={497--550}, year={2006}, publisher={Springer} } @article{zhucirc, title={Circular chromatic number of planar graphs of large odd girth}, author={Zhu, Xuding}, journal={Electronic J. of Combinatorics}, volume={8}, pages={R25}, year={2001} } @article{CR16, title={Planar graphs have independence ratio at least $3/13$}, author={D. W. Cranston and L. Rabern}, journal={Electronic J. of Combinatorics}, volume={23}, pages={P3.45}, year={2016} } @article{bkkw, title={Homomorphisms from sparse graphs with large girth}, author={Borodin, Oleg and Kim, S-J. and Kostochka, Alexandr and West, Douglas}, journal={Journal of Combinatorial Theory, Series B}, volume={90}, number={1}, pages={147--159}, year={2004} } @article{vince, author = {Vince, A.}, title = {Star chromatic number}, journal = {Journal of Graph Theory}, volume = {12}, number = {4}, pages = {551--559}, year = {1988} } @inproceedings{jaeger, title={On circular flows in graphs}, author={F. Jaeger}, booktitle={Finite and Infinite Sets (Eger, 1981), Colloq. Math. Soc. J. Bolyai}, volume={37}, pages={391--402}, year={1984} } @article{matopriv, author = {Matou\v{s}ek, J. and P\v{r}{\'\i}v\v{e}tiv\'y, A.}, title = {Large Monochromatic Components in Two-Colored Grids}, journal = {SIAM Journal on Discrete Mathematics}, volume = {22}, pages = {295--311}, year = {2008} } @incollection{dmnich, title={Large independent sets in triangle-free planar graphs}, author={Dvo{\v{r}}{\'a}k, Zden{\v{e}}k and Mnich, Matthias}, booktitle={Algorithms-ESA 2014}, pages={346--357}, year=2014, publisher={Springer} } @article{berkos, author="A. Bernshteyn and A. Kostochka", title="Sharp {D}irac's Theorem for {DP}-critical graphs", journal={arXiv}, volume={1609.09122}, year=2016 } @article{berkospron, author="A. Bernshteyn and A. Kostochka and S. Pron", title="On {DP}-coloring of graphs and multigraphs", journal="Sib. Mat. Zhurnal", year=2016, note="In Russian, to appear. English version: arXiv:1609.00763" } @article{dmnichfull, title={Large independent sets in triangle-free planar graphs}, author={Dvo{\v{r}}{\'a}k, Zden{\v{e}}k and Mnich, Matthias}, journal={SIAM J. Discrete Math.}, volume=31, pages={1355--1373}, year=2017 } @article{MW, author = {Marx, D. and Wollan, P.}, title = {Immersions in Highly Edge Connected Graphs}, journal = {SIAM Journal on Discrete Mathematics}, volume = {28}, number = {1}, pages = {503-520}, year = {2014} } @misc{mat, author = {J. Matou{\v{s}}ek and J. Vondr{\'a}k}, title = "The probabilistic method", note="Lecture notes", howpublished={\url{http://kam.mff.cuni.cz/~matousek/lectnotes.html}} } @article{jiang, author = {T. Jiang}, title={Compact topological minors in graphs}, journal={J. Graph Theory}, volume=67, year=2011, pages={139--152}} @article{fracsub, author = {Zdenek Dvo\v{r}\'ak and Jean-S{\'e}bastien Sereni and Jan Volec}, title = {Subcubic triangle-free graphs have fractional chromatic number at most 14/5}, journal = {Journal of the London Mathematical Society}, volume = 89, year = 2014, pages = "641--662" } @article{frpltr, author = {Zdenek Dvo\v{r}\'ak and Jean-S{\'e}bastien Sereni and Jan Volec}, title = {Fractional coloring of triangle-free planar graphs}, journal = {Electronic Journal of Combinatorics}, volume = 22, year = 2015, pages = "P4.11" } @article{planfr5, author = {A. Hilton and R. Rado and S. Scott}, title = {A $(<5)$-Colour Theorem for Planar Graphs}, journal = {Bull. London Math. Soc.}, volume=5, pages="302--306", year=1973} @incollection{Jones1985, AUTHOR = {Jones, Kathryn Fraughnaugh}, TITLE = {Minimum independence graphs with maximum degree four}, BOOKTITLE = {Graphs and applications ({B}oulder, {C}olo., 1982)}, SERIES = {Wiley-Intersci. Publ.}, PAGES = {221--230}, YEAR = {1985}, PUBLISHER = {Wiley} } @article{submany, title = "Sub-exponentially many 3-colorings of triangle-free planar graphs", journal={J. Combin. Theory, Ser.~B}, volume = "103", pages = "706--712", year = "2013", author = "A. Asadi and Z. Dvo{\v{r}}{\'a}k and L. Postle and R. Thomas" } @article{thom-many, author={C. Thomassen}, title={Many $3$-colorings of triangle-free planar graphs}, journal={J. Combin. Theory, Ser.~B}, volume=97, year=2007, pages="334--349" } @article{BorIrred, author={O. V. Borodin}, title={Irreducible graphs in the {G}r\"unbaum-Havel 3-colour problem}, journal={Discrete Math.}, volume=159, year=1996, pages={247--249} } @article{PosThoHyperb, title={Hyperbolic families and coloring graphs on surfaces}, author={Postle, Luke and Thomas, Robin}, journal={Transactions of the American Mathematical Society, Series B}, volume=5, pages={167--221}, year=2018 } @inproceedings{crossalg, author = {Markus Chimani and Petra Mutzel and Immanuel M. Bomze}, title = {A New Approach to Exact Crossing Minimization}, booktitle = {ESA}, year = {2008}, pages = {284-296}, crossref = {DBLP:conf/esa/2008} } @proceedings{DBLP:conf/esa/2008, editor = {Dan Halperin and Kurt Mehlhorn}, title = {Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings}, booktitle = {ESA}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = {5193}, year = {2008} } @article{confluent, author = {Chen, Jiangzhuo and Kleinberg, Robert D. and Lov\'{a}sz, L\'{a}szl\'{o} and Rajaraman, Rajmohan and Sundaram, Ravi and Vetta, Adrian}, title = {({A}lmost) Tight bounds and existence theorems for single-commodity confluent flows}, journal = {J. ACM}, issue_date = {July 2007}, volume = {54}, number = {4}, month = jul, year = {2007}, issn = {0004-5411}, pages = {16:1--16:32} } @article{ChChGrid, author = {Chekuri, Chandra and Chuzhoy, Julia}, title = {Polynomial Bounds for the Grid-Minor Theorem}, journal = {J. ACM}, volume = {63}, number = {5}, year = {2016}, pages = {40:1--40:65} } @article{HaWoTree, author = "Harvey, David and Wood, David", title = "Parameters tied to treewidth", journal = {Journal of Graph Theory}, volume = 84, year = 2017, pages = {364--385} } @unpublished{Fox, author = "Fox, Jacob", title = "Constructing dense graphs with sublinear {H}adwiger number", url = "http://arxiv.org/abs/1108.4953", note = "J. Combin. Theory Ser. B, to appear" } @article {BPTWBand, AUTHOR = {B{\"o}ttcher, Julia and Pruessmann, Klaas P. and Taraz, Anusch and W{\"u}rfl, Andreas}, TITLE = {Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs}, JOURNAL = {European J. Combin.}, FJOURNAL = {European Journal of Combinatorics}, VOLUME = {31}, YEAR = {2010}, NUMBER = {5}, PAGES = {1217--1227}, ISSN = {0195-6698}, MRCLASS = {05C12 (05C10 05C83)}, MRNUMBER = {2644412 (2012a:05091)}, DOI = {10.1016/j.ejc.2009.10.010}, URL = {http://dx.doi.org/10.1016/j.ejc.2009.10.010}, } @article {BGHKTree, AUTHOR = {Bodlaender, Hans L. and Gilbert, John R. and Hafsteinsson, Hj{\'a}lmt{\'y}r and Kloks, Ton}, TITLE = {Approximating treewidth, pathwidth, frontsize, and shortest elimination tree}, JOURNAL = {J. Algorithms}, FJOURNAL = {Journal of Algorithms}, VOLUME = {18}, YEAR = {1995}, NUMBER = {2}, PAGES = {238--255}, ISSN = {0196-6774}, DOI = {10.1006/jagm.1995.1009}, URL = {http://dx.doi.org/10.1006/jagm.1995.1009}, } @article{PR1, author = {Pinontoan, Benny and Richter, R. Bruce}, title = {Crossing numbers of sequences of graphs. {I}. {G}eneral tiles}, journal = {Australas. J. Combin.}, volume = {30}, year = {2004}, pages = {197--206} } @article{PR2, AUTHOR = {Pinontoan, Benny and Richter, R. Bruce}, TITLE = {Crossing numbers of sequences of graphs. {II}. {P}lanar tiles}, JOURNAL = {J. Graph Theory}, FJOURNAL = {Journal of Graph Theory}, VOLUME = {42}, YEAR = {2003}, NUMBER = {4}, PAGES = {332--341}, MRCLASS = {05C10}, MRNUMBER = {1963105 (2004e:05060)}, DOI = {10.1002/jgt.10097}, URL = {http://dx.doi.org/10.1002/jgt.10097}, } @article{Pinon06, AUTHOR = {Pinontoan, Benny}, TITLE = {Tile with rational average crossing number}, JOURNAL = {J. Indones. Math. Soc.}, FJOURNAL = {Journal of the Indonesian Mathematical Society. Majalah Ilmiah Himpunan Matematika Indonesia (MIHMI)}, VOLUME = {12}, YEAR = {2006}, NUMBER = {1}, PAGES = {83--87}, MRCLASS = {05C10}, MRNUMBER = {2208030 (2006i:05051)}, } @MISC{BIRSreport, author = "Archdeacon, Dan and Salazar, Gelasio and Sz\'ekely, L\'azsl\'o", note = "Crossing numbers turn useful, Report on BIRS Workshop (11w5144)", url = "http://www.birs.ca/workshops/2011/11w5144/report11w5144.pdf", year = 2011 } @article{plansat, author = {David Lichtenstein}, title = {Planar Formulae and Their Uses}, journal = {SIAM J. Comput.}, volume = {11}, year = {1982}, pages = {329-343} } @inproceedings{minalg1, author={K. Kawarabayashi and P. Wollan}, title={A simpler algorithm and shorter proof for the graph minor decomposition}, booktitle = {STOC}, year = {2011}, pages = {451--458}, crossref = {stoc43}} @inproceedings{minalg2, author = {Martin Grohe and {Ken-ichi} Kawarabayashi and Bruce A. Reed}, title = {A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory}, booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} {S}ymposium on {D}iscrete {A}lgorithms, {SODA} 2013, {N}ew {O}rleans, {L}ouisiana, {USA}, {J}anuary 6-8, 2013}, year = {2013}, pages = {414--431}, publisher = {SIAM}, } @article{locplanq, author={J. P. Hutchinson}, title={Three-Coloring Graphs Embedded on Surfaces with All Faces Even-Sided}, journal={J. Combin. Theory, Ser.~B}, volume=65, pages="139--155", year=1995} @article{NakNegOta, author = {A. Nakamoto and S. Negami and K. Ota}, title={Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces}, journal={Discrete Math.}, volume =285, year=2004, pages="211--218"} @article{MohSey, author={B. Mohar and P. D. Seymour}, title={Coloring locally bipartite graphs on surfaces}, journal={J. Combin. Theory, Ser.~B}, volume=84, year=2002,