Related papers: Posets with $k$-outerplanar cover graphs have boun…

We show that every 1-planar graph with minimum degree at least 4 has girth at most $8$, and every 1-planar graph with minimum degree at least 3 has girth at most $198$.

A geometric graph \G is a simple graph drawn in the plane, on points in general position, with straight-line edges. We call \G a geometric realization of the underlying abstract graph G. A geometric homomorphism from \G to \H is a vertex…

The page number of a directed acyclic graph $G$ is the minimum $k$ for which there is a topological ordering of $G$ and a $k$-coloring of the edges such that no two edges of the same color cross, i.e., have alternating endpoints along the…

A variety of possible extensions of mappings between posets to their Dedekind order completion is presented. One of such extensions has recently been used for solving large classes of nonlinear systems of partial differential equations with…

Dimension is a standard and well-studied measure of complexity of posets. Recent research has provided many new upper bounds on the dimension for various structurally restricted classes of posets. Bounded dimension gives a succinct…

We examine connections between the gonality, treewidth, and orientable genus of a graph. Especially, we find that hyperelliptic graphs in the sense of Baker and Norine are planar. We give a notion of a bielliptic graph and show that each of…

In 2016, Dowden initiated the study of planar Tur\'an-type problems, which has since attracted considerable attention. Recently, Bekos et al. proved that every $K_3$-free $1$-planar graph on $n\ge 4$ vertices has at most $3n-6$ edges. In…

Given a connected outerplanar graph G of pathwidth p, we give an algorithm to add edges to G to get a supergraph of G, which is 2-vertex-connected, outerplanar and of pathwidth O(p). This settles an open problem raised by Biedl, in the…

We produce an upper bound for the Hausdorff dimension of the graph of a Weierstrass-type function. Whilst strictly weaker than existing results, it has the advantage of being directly computable from the theory of hyperbolic iterated…

We study edge-isoperimetric inequalities in chamber graphs of affine hyperplane arrangements. Our approach is topological: to a set of chambers we associate its thickening in Euclidean space and estimate its edge boundary through the…

Let ${\rm ex}_{\mathcal{P}}(n,T,H)$ denote the maximum number of copies of $T$ in an $n$-vertex planar graph which does not contain $H$ as a subgraph. When $T=K_2$, ${\rm ex}_{\mathcal{P}}(n,T,H)$ is the well studied function, the planar…

It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides, for the first time, theoretical evidence supporting this for…

For $e \in S^{2}$, the unit sphere in $\mathbb{R}^3$, let $\pi_{e}$ be the orthogonal projection to $e^{\perp} \subset \mathbb{R}^{3}$, and let $W \subset \mathbb{R}^{3}$ be any $2$-plane, which is not a subspace. We prove that if $K…

The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separating thickness from geometric thickness. In: Towards a…

We show that a set of small box counting dimension can be covered by a H\"older graph from all but a small set of directions, and give sharp bounds for the dimension of the exceptional set, improving a result of B. Hunt and V. Kaloshin. We…

We analyse properties of geometric intersection graphs to show the strict containment between some natural classes of geometric intersection graphs. In particular, we show the following properties: - A graph $G$ is outerplanar if and only…

A resolving set of a graph is a set of vertices with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. In this paper, we construct a resolving set of Johnson graphs, doubled Odd…

Let $C_{s,t}$ be the complete bipartite geometric graph, with $s$ and $t$ vertices on two distinct parallel lines respectively, and all $s t$ straight-line edges drawn between them. In this paper, we show that every complete bipartite…

This paper studies a \emph{packing} problem in the so-called beyond-planar setting, that is when the host graph is ``almost-planar'' in some sense. Precisely, we consider the case that the host graph is $k$-planar, i.e., it admits an…

The connections between quasi-Assouad dimension and tangents are studied. We apply these results to the calculation of the quasi-Assouad dimension for a class of planar self-affine sets. We also show that sets with decreasing gaps have…