105,040 research outputs found
Transforming triangulations on non planar-surfaces
We consider whether any two triangulations of a polygon or a point set on a
non-planar surface with a given metric can be transformed into each other by a
sequence of edge flips. The answer is negative in general with some remarkable
exceptions, such as polygons on the cylinder, and on the flat torus, and
certain configurations of points on the cylinder.Comment: 19 pages, 17 figures. This version has been accepted in the SIAM
Journal on Discrete Mathematics. Keywords: Graph of triangulations,
triangulations on surfaces, triangulations of polygons, edge fli
Arbitrary Orientations of Hamilton Cycles in Digraphs
Let be sufficiently large and suppose that is a digraph on
vertices where every vertex has in- and outdegree at least . We show that
contains every orientation of a Hamilton cycle except, possibly, the
antidirected one. The antidirected case was settled by DeBiasio and Molla,
where the threshold is . Our result is best possible and improves on an
approximate result by H\"aggkvist and Thomason.Comment: Final version, to appear in SIAM Journal Discrete Mathematics (SIDMA
Arithmetic of marked order polytopes, monotone triangle reciprocity, and partial colorings
For a poset P, a subposet A, and an order preserving map F from A into the
real numbers, the marked order polytope parametrizes the order preserving
extensions of F to P. We show that the function counting integral-valued
extensions is a piecewise polynomial in F and we prove a reciprocity statement
in terms of order-reversing maps. We apply our results to give a geometric
proof of a combinatorial reciprocity for monotone triangles due to Fischer and
Riegler (2011) and we consider the enumerative problem of counting extensions
of partial graph colorings of Herzberg and Murty (2007).Comment: 17 pages, 10 figures; V2: minor changes (including title); V3:
examples included (suggested by referee), to appear in "SIAM Journal on
Discrete Mathematics
Necessary conditions for tractability of valued CSPs
The connection between constraint languages and clone theory has been a
fruitful line of research on the complexity of constraint satisfaction
problems. In a recent result, Cohen et al. [SICOMP'13] have characterised a
Galois connection between valued constraint languages and so-called weighted
clones. In this paper, we study the structure of weighted clones. We extend the
results of Creed and Zivny from [CP'11/SICOMP'13] on types of weightings
necessarily contained in every nontrivial weighted clone. This result has
immediate computational complexity consequences as it provides necessary
conditions for tractability of weighted clones and thus valued constraint
languages. We demonstrate that some of the necessary conditions are also
sufficient for tractability, while others are provably not.Comment: To appear in SIAM Journal on Discrete Mathematics (SIDMA
Approximate Hamilton decompositions of robustly expanding regular digraphs
We show that every sufficiently large r-regular digraph G which has linear
degree and is a robust outexpander has an approximate decomposition into
edge-disjoint Hamilton cycles, i.e. G contains a set of r-o(r) edge-disjoint
Hamilton cycles. Here G is a robust outexpander if for every set S which is not
too small and not too large, the `robust' outneighbourhood of S is a little
larger than S. This generalises a result of K\"uhn, Osthus and Treglown on
approximate Hamilton decompositions of dense regular oriented graphs. It also
generalises a result of Frieze and Krivelevich on approximate Hamilton
decompositions of quasirandom (di)graphs. In turn, our result is used as a tool
by K\"uhn and Osthus to prove that any sufficiently large r-regular digraph G
which has linear degree and is a robust outexpander even has a Hamilton
decomposition.Comment: Final version, published in SIAM Journal Discrete Mathematics. 44
pages, 2 figure
- …