1,268 research outputs found
Generic Rigidity Matroids with Dilworth Truncations
We prove that the linear matroid that defines generic rigidity of
-dimensional body-rod-bar frameworks (i.e., structures consisting of
disjoint bodies and rods mutually linked by bars) can be obtained from the
union of graphic matroids by applying variants of Dilworth
truncation times, where denotes the number of rods. This leads to
an alternative proof of Tay's combinatorial characterizations of generic
rigidity of rod-bar frameworks and that of identified body-hinge frameworks
Tangle-tree duality: in graphs, matroids and beyond
We apply a recent duality theorem for tangles in abstract separation systems
to derive tangle-type duality theorems for width-parameters in graphs and
matroids. We further derive a duality theorem for the existence of clusters in
large data sets.
Our applications to graphs include new, tangle-type, duality theorems for
tree-width, path-width, and tree-decompositions of small adhesion. Conversely,
we show that carving width is dual to edge-tangles. For matroids we obtain a
duality theorem for tree-width.
Our results can be used to derive short proofs of all the classical duality
theorems for width parameters in graph minor theory, such as path-width,
tree-width, branch-width and rank-width.Comment: arXiv admin note: text overlap with arXiv:1406.379
The Effect of Planarization on Width
We study the effects of planarization (the construction of a planar diagram
from a non-planar graph by replacing each crossing by a new vertex) on
graph width parameters. We show that for treewidth, pathwidth, branchwidth,
clique-width, and tree-depth there exists a family of -vertex graphs with
bounded parameter value, all of whose planarizations have parameter value
. However, for bandwidth, cutwidth, and carving width, every graph
with bounded parameter value has a planarization of linear size whose parameter
value remains bounded. The same is true for the treewidth, pathwidth, and
branchwidth of graphs of bounded degree.Comment: 15 pages, 6 figures. To appear at the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017
Quantum Query Complexity of Subgraph Containment with Constant-sized Certificates
We study the quantum query complexity of constant-sized subgraph containment.
Such problems include determining whether an -vertex graph contains a
triangle, clique or star of some size. For a general subgraph with
vertices, we show that containment can be solved with quantum query
complexity , with a strictly positive
function of . This is better than \tilde{O}\s{n^{2-2/k}} by Magniez et
al. These results are obtained in the learning graph model of Belovs.Comment: 14 pages, 1 figure, published under title:"Quantum Query Complexity
of Constant-sized Subgraph Containment
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree
A spanning tree of graph is a -approximate universal Steiner
tree (UST) for root vertex if, for any subset of vertices containing
, the cost of the minimal subgraph of connecting is within a
factor of the minimum cost tree connecting in . Busch et al. (FOCS 2012)
showed that every graph admits -approximate USTs by
showing that USTs are equivalent to strong sparse partition hierarchies (up to
poly-logs). Further, they posed poly-logarithmic USTs and strong sparse
partition hierarchies as open questions.
We settle these open questions by giving polynomial-time algorithms for
computing both -approximate USTs and poly-logarithmic strong
sparse partition hierarchies. For graphs with constant doubling dimension or
constant pathwidth we improve this to -approximate USTs and
strong sparse partition hierarchies. Our doubling dimension result is tight up
to second order terms. We reduce the existence of these objects to the
previously studied cluster aggregation problem and what we call dangling nets.Comment: @FOCS2
New measures of graph irregularity
In this paper, we define and compare four new measures of graph irregularity.
We use these measures to prove upper bounds for the chromatic number and the
Colin de Verdiere parameter. We also strengthen the concise Turan theorem for
irregular graphs and investigate to what extent Turan's theorem can be
similarly strengthened for generalized r-partite graphs. We conclude by
relating these new measures to the Randic index and using the measures to
devise new normalised indices of network heterogeneity
Percolation by cumulative merging and phase transition for the contact process on random graphs
Given a weighted graph, we introduce a partition of its vertex set such that
the distance between any two clusters is bounded from below by a power of the
minimum weight of both clusters. This partition is obtained by recursively
merging smaller clusters and cumulating their weights. For several classical
random weighted graphs, we show that there exists a phase transition regarding
the existence of an infinite cluster.
The motivation for introducing this partition arises from a connection with
the contact process as it roughly describes the geometry of the sets where the
process survives for a long time. We give a sufficient condition on a graph to
ensure that the contact process has a non trivial phase transition in terms of
the existence of an infinite cluster. As an application, we prove that the
contact process admits a sub-critical phase on d-dimensional random geometric
graphs and on random Delaunay triangulations. To the best of our knowledge,
these are the first examples of graphs with unbounded degrees where the
critical parameter is shown to be strictly positive.Comment: 50 pages, many figure
- …