Related papers: Finite planar emulators for K_{4,5} - 4K_2 and K_{…
We prove that if a unimodular random graph is almost surely planar and has finite expected degree, then it has a combinatorial embedding into the plane which is also unimodular. This implies the claim in the title immediately by a theorem…
We investigate a conjecture on the cover times of planar graphs by means of large Monte Carlo simulations. The conjecture states that the cover time $\tau(G_{N})$ of a planar graph $G_{N}$ of $N$ vertices and maximal degree $d$ is lower…
We construct minor-closed addable families of graphs that are subcritical and contain all planar graphs. This contradicts (one direction of) a well-known conjecture of Noy.
We present a new model for hybrid planarity that relaxes existing hybrid representations. A graph $G = (V,E)$ is $(k,p)$-planar if $V$ can be partitioned into clusters of size at most $k$ such that $G$ admits a drawing where: (i) each…
We study two decomposition problems in combinatorial geometry. The first part deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold…
A stable smooth map $f:N\to M$ is called "$k$-realizable" if its composition with the inclusion $M\subset M\times\Bbb R^k$ is $C^0$-approximable by smooth embeddings; and a "$k$-prem" if the same composition is $C^\infty$-approximable by…
We define a canonical relative commutant planar algebra from a strongly Markov inclusion of finite von Neumann algebras. In the case of a connected unital inclusion of finite dimensional C*-algebras with the Markov trace, we show this…
A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…
Splitter sets have been widely studied due to their applications in flash memories, and their close relations with lattice tilings and conflict avoiding codes. In this paper, we give necessary and sufficient conditions for the existence of…
Merker conjectured that if $k \ge 2$ is an integer and $G$ a 3-connected cubic planar graph of circumference at least $k$, then the set of cycle lengths of $G$ must contain at least one element of the interval $[k, 2k+2]$. We here prove…
We consider real forms of relatively minimal rational surfaces F_m. Connected components of moduli of real non-singular curves in |-2K_{F_m}| had been classified recently for m=0, 1, 4 in math.AG/0312396. Applying similar methods, here we…
For a fixed positive integer $k$ and a graph $G$, let $\lambda_k(G)$ denote the $k$-th largest eigenvalue of the adjacency matrix of $G$. In 2017, Tait and Tobin proved that the maximum $\lambda_1(G)$ among all outerplanar graphs on $n$…
A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way, there are a constant-sized subset of vertices within which…
We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call the embedded-width of a plane graph. We show both upper…
A graph $G$ is $k$-degenerate if it can be transformed into an empty graph by subsequent removals of vertices of degree $k$ or less. We prove that every connected planar graph with average degree $d \ge 2$ has a 4-degenerate induced…
In this paper, we discuss complete minimal immersions in $\mathbb{R}^N$($N\geq4$) with finite total curvature and embedded planar ends. First, we prove nonexistence for the following cases: (1) genus 1 with 2 embedded planar ends, (2) genus…
Generalizing Jones's notion of a planar algebra, we have previously introduced an A_2-planar algebra capturing the structure contained in the double complex pertaining to the subfactor for a finite SU(3) ADE graph with a flat cell system.…
Win [\emph{J. Graph Theory} {\bf 6}(1982), 489--492] conjectured that a graph $G$ on $n$ vertices contains $k$ disjoint perfect matchings, if the degree sum of any two nonadjacent vertices is at least $n+k-2$, where $n$ is even and $n\geq…
Erd\"{o}s and Tur\'{a}n once conjectured that any set $A\subset\mathbb{N}$ with $\sum_{a\in A}{1}/{a}=\infty$ should contain infinitely many progressions of arbitrary length $k\geq3$. For the two-dimensional case Graham conjectured that if…
This note outlines the realizable extension problem for weighted graphs and provides results of a detailed analysis of this problem for the weighted graph $(K_{3,3},l)$. This analysis is then utilized to provide a result relating to the…