Skip to content
GitLab
Menu
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
c9a0340c
Commit
c9a0340c
authored
Sep 16, 2021
by
Zdenek Dvorak
Browse files
Added the consequence with regards to the existence of sublinear separators.
parent
4278f250
Changes
1
Show whitespace changes
Inline
Sidebyside
comparableboxdimension.tex
View file @
c9a0340c
...
@@ 570,6 +570,20 @@ $$\beta(C)1\le (2ksd+2)^dst=f(k),$$
...
@@ 570,6 +570,20 @@ $$\beta(C)1\le (2ksd+2)^dst=f(k),$$
as required.
as required.
\end{proof}
\end{proof}
The proof that (generalizations of) graphs with bounded comparable box dimensions have sublinear separators in~
\cite
{
subconvex
}
is indirect; it is established that these graphs have polynomial coloring numbers, which in turn implies they have polynomial
expansion, which then gives sublinear separators using the algorithm of Plotkin, Rao, and Smith~
\cite
{
plotkin
}
.
The existence of sublinear separators is known to follow more directly from fractional treewidthfragility. Indeed, since
$
\text
{
Pr
}
[
v
\in
X
]
\le
1
/
k
$
,
there exists
$
X
\subseteq
V
(
G
)
$
such that
$
\tw
(
G

X
)
\le
f
(
k
)
$
and
$
X
\le
V
(
G
)

/
k
$
. The graph
$
G

X
$
has a balanced separator of size
at most
$
\tw
(
G

X
)+
1
$
, which combines with
$
X
$
to a balanced separator of size at most
$
V
(
G
)

/
k
+
f
(
k
)+
1
$
in
$
G
$
.
Optimizing the value of
$
k
$
(choosing it so that
$
V
(
G
)

/
k
=
f
(
k
)
$
), we obtain the following corollary of Theorem~
\ref
{
thmtwfrag
}
.
\begin{corollary}
For positive integers
$
t
$
,
$
s
$
, and
$
d
$
, every graph
$
G
$
with an
$
s
$
comparable envelope representation in
$
\mathbb
{
R
}^
d
$
of thickness at most
$
t
$
has a sublinear separator of size
$
O
_{
t,s,d
}
\bigl
(
V
(
G
)

^{
\tfrac
{
d
}{
d
+
1
}}
\bigr
)
.
$
\end{corollary}
\subsection*
{
Acknowledgments
}
\subsection*
{
Acknowledgments
}
This research was carried out at the workshop on Geometric Graphs and Hypergraphs organized by Yelena Yuditsky and Torsten Ueckerdt
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.
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
.
Attach a 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