1,545 research outputs found
Hyperbolic intersection graphs and (quasi)-polynomial time
We study unit ball graphs (and, more generally, so-called noisy uniform ball
graphs) in -dimensional hyperbolic space, which we denote by .
Using a new separator theorem, we show that unit ball graphs in
enjoy similar properties as their Euclidean counterparts, but in one dimension
lower: many standard graph problems, such as Independent Set, Dominating Set,
Steiner Tree, and Hamiltonian Cycle can be solved in
time for any fixed , while the same problems need
time in . We also show that these algorithms in
are optimal up to constant factors in the exponent under ETH.
This drop in dimension has the largest impact in , where we
introduce a new technique to bound the treewidth of noisy uniform disk graphs.
The bounds yield quasi-polynomial () algorithms for all of the
studied problems, while in the case of Hamiltonian Cycle and -Coloring we
even get polynomial time algorithms. Furthermore, if the underlying noisy disks
in have constant maximum degree, then all studied problems can
be solved in polynomial time. This contrasts with the fact that these problems
require time under ETH in constant maximum degree
Euclidean unit disk graphs.
Finally, we complement our quasi-polynomial algorithm for Independent Set in
noisy uniform disk graphs with a matching lower bound
under ETH. This shows that the hyperbolic plane is a potential source of
NP-intermediate problems.Comment: Short version appears in SODA 202
Colouring exact distance graphs of chordal graphs
For a graph and positive integer , the exact distance- graph
is the graph with vertex set and with an edge between
vertices and if and only if and have distance . Recently,
there has been an effort to obtain bounds on the chromatic number
of exact distance- graphs for from certain
classes of graphs. In particular, if a graph has tree-width , it has
been shown that for odd ,
and for even . We
show that if is chordal and has tree-width , then for odd , and for even .
If we could show that for every graph of tree-width there is a
chordal graph of tree-width which contains as an isometric subgraph
(i.e., a distance preserving subgraph), then our results would extend to all
graphs of tree-width . While we cannot do this, we show that for every graph
of genus there is a graph which is a triangulation of genus and
contains as an isometric subgraph.Comment: 11 pages, 2 figures. Versions 2 and 3 include minor changes, which
arise from reviewers' comment
Density of Range Capturing Hypergraphs
For a finite set of points in the plane, a set in the plane, and a
positive integer , we say that a -element subset of is captured
by if there is a homothetic copy of such that ,
i.e., contains exactly elements from . A -uniform -capturing
hypergraph has a vertex set and a hyperedge set consisting
of all -element subsets of captured by . In case when and
is convex these graphs are planar graphs, known as convex distance function
Delaunay graphs.
In this paper we prove that for any , any , and any convex
compact set , the number of hyperedges in is at most , where is the number of -element
subsets of that can be separated from the rest of with a straight line.
In particular, this bound is independent of and indeed the bound is tight
for all "round" sets and point sets in general position with respect to
.
This refines a general result of Buzaglo, Pinchasi and Rote stating that
every pseudodisc topological hypergraph with vertex set has
hyperedges of size or less.Comment: new version with a tight result and shorter proo
On the probability of planarity of a random graph near the critical point
Consider the uniform random graph with vertices and edges.
Erd\H{o}s and R\'enyi (1960) conjectured that the limit
\lim_{n \to \infty} \Pr\{G(n,\textstyle{n\over 2}) is planar}} exists
and is a constant strictly between 0 and 1. \L uczak, Pittel and Wierman (1994)
proved this conjecture and Janson, \L uczak, Knuth and Pittel (1993) gave lower
and upper bounds for this probability.
In this paper we determine the exact probability of a random graph being
planar near the critical point . For each , we find an exact
analytic expression for
In particular, we obtain .
We extend these results to classes of graphs closed under taking minors. As
an example, we show that the probability of being
series-parallel converges to 0.98003.
For the sake of completeness and exposition we reprove in a concise way
several basic properties we need of a random graph near the critical point.Comment: 10 pages, 1 figur
Disjoint list-colorings for planar graphs
One of Thomassen's classical results is that every planar graph of girth at
least is 3-choosable. One can wonder if for a planar graph of girth
sufficiently large and a -list-assignment , one can do even better. Can
one find disjoint -colorings (a packing), or disjoint -colorings,
or a collection of -colorings that to every vertex assigns every color on
average in one third of the cases (a fractional packing)? We prove that the
packing is impossible, but two disjoint -colorings are guaranteed if the
girth is at least , and a fractional packing exists when the girth is at
least
For a graph , the least such that there are always disjoint proper
list-colorings whenever we have lists all of size associated to the
vertices is called the list packing number of . We lower the
two-times-degeneracy upper bound for the list packing number of planar graphs
of girth or . As immediate corollaries, we improve bounds for
-flexibility of classes of planar graphs with a given girth. For
instance, where previously Dvo\v{r}\'{a}k et al. proved that planar graphs of
girth are (weighted) -flexibly -choosable for an extremely
small value of , we obtain the optimal value .
Finally, we completely determine and show interesting behavior on the packing
numbers for -minor-free graphs for some small graphs Comment: 36 pages, 8 figure
- …