Related papers: Average Degree of Graphs Derived From The Ammann A…
In an upward-planar L-drawing of a directed acyclic graph (DAG) each edge $e$ is represented as a polyline composed of a vertical segment with its lowest endpoint at the tail of $e$ and of a horizontal segment ending at the head of $e$.…
We present here an elementary construction of an aperiodic tile set. Although there already exist dozens of examples of aperiodic tile sets we believe this construction introduces an approach that is different enough to be interesting and…
A locally irregular graph is a graph whose adjacent vertices have distinct degrees, a regular graph is a graph where each vertex has the same degree and a locally regular graph is a graph where for every two adjacent vertices u, v, their…
In this paper, the tiling of the Euclidean plane with regular hexagons whose vertices are occupied by carbon atoms is called the graphene. We describe six different ways to generate the graphene by the means of group theory. There are two…
A \emph{geometric graph} is a graph whose vertex set is a set of points in general position in the plane, and its edges are straight line segments joining these points. We show that for every integer $k \ge 2$, there exists a constat $c>0$…
Topological drawings are natural representations of graphs in the plane, where vertices are represented by points, and edges by curves connecting the points. Topological drawings of complete graphs and of complete bipartite graphs have been…
Dotted graphs are certain finite graphs with vertices of degree 2 called dots in the $xy$-plane $\mathbb{R}^2$, and a dotted graph is said to be admissible if it is associated with a lattice polytope in $\mathbb{R}^2$ each of whose edge is…
This work deals with the average scattering entropy of quantum graphs. We explore this concept in several distinct scenarios that involve periodic, aperiodic and random distribution of vertices of distinct degrees. In particular, we compare…
The moduli stack $\mathcal A_2$ of principally polarized abelian surfaces comes equipped with the universal abelian surface $\pi: \mathcal X_2 \to \mathcal A_2$. The fiber of $\pi$ over a point corresponding to an abelian surface $A$ in…
We present a geometric proof of the averaging theorem for perturbed dynamical systems on a Riemannian manifold, in the case where the flow of the unperturbed vector field is periodic and the $\mathbb{S}^{1}$-action associated to this vector…
Given a graph whose edges are labeled by ideals in a ring, a generalized spline is a labeling of each vertex by a ring element so that adjacent vertices differ by an element of the ideal associated to the edge. We study splines over the…
We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of…
A proper edge coloring of a graph $G$ is called acyclic if there is no bichromatic cycle in $G$. The acyclic chromatic index of $G$, denoted by $\chi'_a(G)$, is the least number of colors $k$ such that $G$ has an acyclic edge $k$-coloring.…
A total coloring of a graph $G$ is a coloring of its vertices and edges such that no adjacent vertices, edges, and no incident vertices and edges obtain the same color. An \emph{interval total $t$-coloring} of a graph $G$ is a total…
A recent paper of Balogh, Li and Treglown initiated the study of Dirac-type problems for ordered graphs. In this paper we prove a number of results in this area. In particular, we determine asymptotically the minimum degree threshold for…
We construct the first aperiodic tiles for two amenable 3-dimensional Lie groups: Sol and the Heisenberg group. Our construction relies on the use of higher-dimensional uniformly finite homology. In particular, we settle completely the…
An edge coloring of a graph $G$ is to color all the edges in the graph such that adjacent edges receive different colors. It is acyclic if each cycle in the graph receives at least three colors. Fiam{\v{c}}ik (1978) and Alon, Sudakov and…
In octilinear drawings of planar graphs, every edge is drawn as an alternating sequence of horizontal, vertical and diagonal ($45^\circ$) line-segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few…
This paper concerns self-similar tilings in dimension 2. We consider the number of occurrences of a given tile in any domain bounded by a Jordan curve. For a large class of self-similar tilings, including most known examples, we give…
We consider the degree/diameter problem for graphs embedded in a surface, namely, given a surface $\Sigma$ and integers $\Delta$ and $k$, determine the maximum order $N(\Delta,k,\Sigma)$ of a graph embeddable in $\Sigma$ with maximum degree…