Skip to content
GitLab
Projects
Groups
Snippets
/
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
Zdenek Dvorak
Comparable box dimension
Commits
8c0aa411
Commit
8c0aa411
authored
Sep 09, 2021
by
Zdenek Dvorak
Browse files
Minors.
parent
dfb16030
Changes
1
Hide whitespace changes
Inline
Sidebyside
comparableboxdimension.tex
View file @
8c0aa411
...
...
@@ 395,6 +395,60 @@ $\cbdim(G)\le 5\cdot 81^{6^{\cbdim(\GG)}}$.
\section
{
The product structure and minorclosed classes
}
Let
$
G
\boxtimes
H
$
denote the
\emph
{
strong product
}
of the graphs
$
G
$
and
$
H
$
, i.e., the graph with vertex
set
$
V
(
G
)
\times
V
(
H
)
$
and with distinct vertices
$
(
u
_
1
,v
_
1
)
$
and
$
(
u
_
2
,v
_
2
)
$
adjacent if and only if
either
$
u
_
1
=
u
_
2
$
or
$
u
_
1
u
_
2
\in
E
(
G
)
$
and either
$
v
_
1
=
v
_
2
$
or
$
v
_
1
v
_
2
\in
E
(
G
)
$
.
Dujmovi
{
\'
c
}
et al.~
\cite
{
DJM+
}
proved the following result.
\begin{theorem}
\label
{
thmprod
}
Any graph
$
G
$
is a subgraph of the strong product of a path, a graph of threewidth at most
$
t
$
, and
$
K
_
m
$
, where
\begin{itemize}
\item
$
t
=
3
$
and
$
m
=
3
$
if
$
G
$
is planar, and
\item
$
t
=
4
$
and
$
m
=
\max
(
2
g,
3
)
$
if
$
G
$
has Euler genus at most
$
g
$
.
\end{itemize}
Moreover, for every
$
k
$
, there exists
$
t
$
such that if
$
K
_
k
\not\preceq
_
m G
$
, then
$
G
$
is a subgraph of a cliquesum
for graphs that can be obtained from the strong product of a path and a graph of treewidth at most
$
t
$
by adding
at most
$
t
$
apex vertices.
\end{theorem}
The connection to the comparable box dimension comes from the following observation.
\begin{lemma}
\label
{
lemmaps
}
The strong product of a path
$
P
$
, a graph
$
T
$
of treewidth at most
$
t
$
, and
$
K
_
m
$
has
comparable box dimension at most
$
t
+
2
+
\lceil
\log
_
2
m
\rceil
$
.
\end{lemma}
\begin{proof}
Without loss of generality, we can assume that
$
k
=
\log
_
2
m
$
is an integer and the
vertices of
$
K
_
m
$
are elements of
$
\{
0
,
1
\}
^
k
$
. Moreover, we can assume that
$
V
(
P
)=
\{
1
,
\ldots
,n
\}
$
with
$
ij
\in
E
(
P
)
$
iff
$
i

j
=
1
$
. Let
$
h
$
be the touching representation of
$
T
$
by
hypercubes in
$
\mathbb
{
R
}^{
t
+
1
}$
obtained by Lemma~
\ref
{
lemmatw
}
.
The representation
$
f
$
of
$
P
\boxtimes
T
\boxtimes
K
_
m
$
in
$
\mathbb
{
R
}^{
t
+
2
+
k
}$
is obtained as follows: For
$
p
\in
V
(
P
)
$
,
$
v
\in
V
(
T
)
$
, and
$
(
x
_
1
,
\ldots
, x
_
k
)
\in
V
(
K
_
m
)
$
,
we set
$$
f
(
p,v,x
_
1
,
\ldots
, x
_
k
)[
j
]=
\begin
{
cases
}
f
(
v
)[
j
]
&
\text
{
for $j
=
1
,
\ldots
, t
+
1
$
}
\\
[
p,p
+
1
]
&
\text
{
if $j
=
t
+
2
$
}
\\
[
x
_{
j

t

2
}
,x
_{
j

t

2
}
+
1
]
&
\text
{
if $j>t
+
2
$.
}
\end
{
cases
}$$
Clearly, this is a touching representation by comparable boxes.
\end{proof}
Combining Theorem~
\ref
{
thmprod
}
, Lemma~
\ref
{
lemmaps
}
, and the results of the previous section,
we obtain the following corollary, which in particular implies Theorem~
\ref
{
thmminor
}
.
\begin{corollary}
\label
{
corminor
}
For every graph
$
G
$
of Euler genus
$
g
$
, there exists a supergraph
$
G'
$
of
$
G
$
such that
$
\cbdim
(
G'
)
\le
6
+
\lceil
\log
_
2
\max
(
2
g,
3
)
\rceil
$
. Consequently,
$$
\cbdim
(
G
)
\le
5
\cdot
81
^
7
\cdot
(
2
g
+
3
)
^{
\log
_
2
81
}
.
$$
Moreover, for every
$
k
$
there exists
$
d
$
such that if
$
K
_
k
\not\preceq
_
m
(
G
)
$
, then
$
\cbdim
(
G
)
\le
d
$
.
\end{corollary}
Note that the graph obtained from
$
K
_{
2
n
}$
by deleting a perfect matching has Euler genus
$
\Theta
(
n
^
2
)
$
and comparable box dimension
$
n
$
, showing that the dependence of the comparable box dimension cannot be
subpolynomial (though the degree
$
\log
_
2
81
$
of the polynomial established in Corollary~
\ref
{
corminor
}
certainly can be improved). The dependence of the comparable box dimension on the size of the forbidden minor that we
established is not explicit, as Theorem~
\ref
{
thmprod
}
is based on the structure theorem of Robertson and Seymour~
\cite
{
robertson2003graph
}
.
It would be interesting to prove this part of Corollary~
\ref
{
corminor
}
without using the structure theorem.
\subsection*
{
Acknowledgments
}
This research was carried out at the workshop on Geometric Graphs and Hypergraphs organized by Yelena Yuditsky and Torsten Ueckerdt
in September 2021. We would like to thank the organizers and all participants for creating a friendly and productive environment.
...
...
Write
Preview
Supports
Markdown
0%
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment