Related papers: Triangle-Free Triangulations

We characterize mutation-finite cluster algebras of rank at least 3 using positive semi-definite quadratic forms. In particular, we associate with every unpunctured bordered surface a positive semi-definite quadratic space $V$, and with…

We characterise which simplicial surfaces can be folded onto a triangle. We define a notion of folding that incorporates the non-intersection-properties of real materials. All of the surfaces foldable onto a triangle admit a…

Some general criteria to produce explicit free algebras inside the division ring of fractions of skew polynomial rings are presented. These criteria are applied to some special cases of division rings with natural involutions, yielding, for…

We show that the size of a 4-critical graph of girth at least five is bounded by a linear function of its genus. This strengthens the previous bound on the size of such graphs given by Thomassen. It also serves as the basic case for the…

We describe the statistics of checkerboard triangulations obtained by colouring black every other triangle in triangulations of convex polygons.

Flips in triangulations of convex polygons arise in many different settings. They are isomorphic to rotations in binary trees, define edges in the 1-skeleton of the Associahedron and cover relations in the Tamari Lattice. The complexity of…

Let $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$. Examples of crossing-free structures include triangulations of $P$, spanning cycles of $P$, also known as polygonalizations…

Several classical constructions illustrate the fact that the chromatic number of a graph can be arbitrarily large compared to its clique number. However, until very recently, no such construction was known for intersection graphs of…

By studying the action of the Weyl group of a simple Lie algebra on its root lattice, we construct torsion free subgroups of small and explicitly determined index in a large infinite class of Coxeter groups. One spin-off is the construction…

We give a linear-time algorithm to decide 3-colorability (and find a 3-coloring, if it exists) of quadrangulations of a fixed surface. The algorithm also allows to prescribe the coloring for a bounded number of vertices.

We generalize the enhanced power graph by replacing elements with conjugacy classes. The main result of this paper is to determine when this graph is triangle-free.

Recently, it was proved that triangle-free intersection graphs of $n$ line segments in the plane can have chromatic number as large as $\Theta(\log\log n)$. Essentially the same construction produces $\Theta(\log\log n)$-chromatic…

We show that the triangulations of a finite point set form a flip graph that can be embedded isometrically into a hypercube, if and only if the point set has no empty convex pentagon. Point sets of this type include convex subsets of…

In this article we show that there exist measurable sets W in the plane with finite measure that tile the plane in a measurable way under the action of a expansive matrix A, an affine Weyl group W, and a full rank lattice G. This note is…

Weyl-orbit functions have been defined for each simple Lie algebra, and permit Fourier-like analysis on the fundamental region of the corresponding affine Weyl group. They have also been discretized, using a refinement of the coweight…

We associate to triangulations of infinite type surface a type of flip graph where simultaneous flips are allowed. Our main focus is on understanding exactly when two triangulations can be related by a sequence of flips. A consequence of…

In this work we consider triangulations of point sets in the Euclidean plane, i.e., maximal straight-line crossing-free graphs on a finite set of points. Given a triangulation of a point set, an edge flip is the operation of removing one…

The affine Weyl groups with their corresponding four types of orbit functions are considered. Two independent admissible shifts, which preserve the symmetries of the weight and the dual weight lattices, are classified. Finite subsets of the…

We study the motion of discrete interfaces driven by ferromagnetic interactions on the two-dimensional triangular lattice by coupling the Almgren, Taylor and Wang minimizing movements approach and a discrete-to-continuum analysis, as…

We give a linear-time algorithm to decide 3-colorability of a triangle-free graph embedded in a fixed surface, and a quadratic-time algorithm to output a 3-coloring in the affirmative case. The algorithms also allow to prescribe the…