20,580 research outputs found
Unit Grid Intersection Graphs: Recognition and Properties
It has been known since 1991 that the problem of recognizing grid
intersection graphs is NP-complete. Here we use a modified argument of the
above result to show that even if we restrict to the class of unit grid
intersection graphs (UGIGs), the recognition remains hard, as well as for all
graph classes contained inbetween. The result holds even when considering only
graphs with arbitrarily large girth. Furthermore, we ask the question of
representing UGIGs on grids of minimal size. We show that the UGIGs that can be
represented in a square of side length 1+epsilon, for a positive epsilon no
greater than 1, are exactly the orthogonal ray graphs, and that there exist
families of trees that need an arbitrarily large grid
Improved Bounds for Drawing Trees on Fixed Points with L-shaped Edges
Let be an -node tree of maximum degree 4, and let be a set of
points in the plane with no two points on the same horizontal or vertical line.
It is an open question whether always has a planar drawing on such that
each edge is drawn as an orthogonal path with one bend (an "L-shaped" edge). By
giving new methods for drawing trees, we improve the bounds on the size of the
point set for which such drawings are possible to: for
maximum degree 4 trees; for maximum degree 3 (binary) trees; and
for perfect binary trees.
Drawing ordered trees with L-shaped edges is harder---we give an example that
cannot be done and a bound of points for L-shaped drawings of
ordered caterpillars, which contrasts with the known linear bound for unordered
caterpillars.Comment: Appears in the Proceedings of the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017
Polygonal Chains Cannot Lock in 4D
We prove that, in all dimensions d>=4, every simple open polygonal chain and
every tree may be straightened, and every simple closed polygonal chain may be
convexified. These reconfigurations can be achieved by algorithms that use
polynomial time in the number of vertices, and result in a polynomial number of
``moves.'' These results contrast to those known for d=2, where trees can
``lock,'' and for d=3, where open and closed chains can lock.Comment: Major revision of the Aug. 1999 version, including: Proof extended to
show trees cannot lock in 4D; new example of the implementation straightening
a chain of n=100 vertices; improved time complexity for chain to O(n^2);
fixed several minor technical errors. (Thanks to three referees.) 29 pages;
15 figures. v3: Reference update
On hierarchical hyperbolicity of cubical groups
Let X be a proper CAT(0) cube complex admitting a proper cocompact action by
a group G. We give three conditions on the action, any one of which ensures
that X has a factor system in the sense of [BHS14]. We also prove that one of
these conditions is necessary. This combines with results of
Behrstock--Hagen--Sisto to show that is a hierarchically hyperbolic group;
this partially answers questions raised by those authors. Under any of these
conditions, our results also affirm a conjecture of BehrstockHagen on
boundaries of cube complexes, which implies that X cannot contain a convex
staircase. The conditions on the action are all strictly weaker than virtual
cospecialness, and we are not aware of a cocompactly cubulated group that does
not satisfy at least one of the conditions.Comment: Minor changes in response to referee report. Streamlined the proof of
Lemma 5.2, and added an examples of non-rotational action
Maximizing Maximal Angles for Plane Straight-Line Graphs
Let be a plane straight-line graph on a finite point set
in general position. The incident angles of a vertex
of are the angles between any two edges of that appear consecutively in
the circular order of the edges incident to .
A plane straight-line graph is called -open if each vertex has an
incident angle of size at least . In this paper we study the following
type of question: What is the maximum angle such that for any finite set
of points in general position we can find a graph from a certain
class of graphs on that is -open? In particular, we consider the
classes of triangulations, spanning trees, and paths on and give tight
bounds in most cases.Comment: 15 pages, 14 figures. Apart of minor corrections, some proofs that
were omitted in the previous version are now include
Infinite Matroids and Determinacy of Games
Solving a problem of Diestel and Pott, we construct a large class of infinite
matroids. These can be used to provide counterexamples against the natural
extension of the Well-quasi-ordering-Conjecture to infinite matroids and to
show that the class of planar infinite matroids does not have a universal
matroid.
The existence of these matroids has a connection to Set Theory in that it
corresponds to the Determinacy of certain games. To show that our construction
gives matroids, we introduce a new very simple axiomatization of the class of
countable tame matroids
Orthogonal forms of Kac--Moody groups are acylindrically hyperbolic
We give sufficient conditions for a group acting on a geodesic metric space
to be acylindrically hyperbolic and mention various applications to groups
acting on CAT() spaces. We prove that a group acting on an irreducible
non-spherical non-affine building is acylindrically hyperbolic provided there
is a chamber with finite stabiliser whose orbit contains an apartment. Finally,
we show that the following classes of groups admit an action on a building with
those properties: orthogonal forms of Kac--Moody groups over arbitrary fields,
and irreducible graph products of arbitrary groups - recovering a result of
Minasyan--Osin.Comment: 20 pages, to appear in Annales de l'Institut Fourie
- …