Related papers: Parallel geodesics and minimal stable length of ra…

Consider a compact surface of genus $\geq 2$ equipped with a metric that is flat everywhere except at finitely many cone points with angles greater than $2\pi$. Following the technique in the work of Burns, Climenhaga, Fisher, and Thompson,…

We describe a new random greedy algorithm for generating regular graphs of high girth: Let $k\geq 3$ and $c \in (0,1)$ be fixed. Let $n \in \mathbb{N}$ be even and set $g = c \log_{k-1} (n)$. Begin with a Hamilton cycle $G$ on $n$ vertices.…

A feedback vertex set of a graph is a subset of vertices intersecting all cycles. We provide tight upper bounds on the size of a minimum feedback vertex set in planar graphs of girth at least five. We prove that if $G$ is a connected planar…

We study $k$-star decompositions, that is, partitions of the edge set into disjoint stars with $k$ edges, in the uniformly random $d$-regular graph model $\mathcal{G}_{n,d}$. Using the small subgraph conditioning method, we prove an…

In this paper we study half-geodesics, those closed geodesics that minimize on any subinterval of length $l(\gamma)/2$. For each nonnegative integer $n$, we construct Riemannian manifolds diffeomorphic to $S^2$ admitting exactly $n$…

A non-complete geometric distance-regular graph is the point graph of a partial geometry in which the set of lines is a set of Delsarte cliques. In this paper, we prove that for fixed integer $m\geq 2$, there are only finitely many…

Given a graph $G$, its Ramsey number $r(G)$ is the minimum $N$ so that every two-coloring of $E(K_N)$ contains a monochromatic copy of $G$. It was conjectured by Conlon, Fox, and Sudakov that if one deletes a single vertex from $G$, the…

Suppose that red and blue points occur as independent Poisson processes of equal intensity in R^d, and that the red points are matched to the blue points via straight edges in a translation-invariant way. We address several closely related…

We show that for each d>0 the d-dimensional Hamming graph H(d,q) has an orientably regular surface embedding if and only if q is a prime power p^e. If q>2 there are up to isomorphism \phi(q-1)/e such maps, all constructed as Cayley maps for…

This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…

For $d \geq 2$ and $G$ a finite abelian group, define $T_d(G)$ to be the minimum number of vertices $n$ so that there exists a simplicial complex $X$ on $n$ vertices which has the torsion part of $H_{d - 1}(X)$ isomorphic to $G$. Here we…

Let $\mu_{\text{2n}}(d,v)$ (respectively, $\mu^{\text{s}}_{\text{2n}}(d,v)$) be the minimal number of facets of a (simplicial) 2-neighborly $d$-polytope with $v$ vertices, $v > d \ge 4$. It is known that $\mu_{\text{2n}}(4,v) = v (v-3)/2$,…

We study the probabilistic existence of point configurations satisfying the $(0, m, d)$-net property in base $b$ within a randomly generated point set of size $N$ in the $d$-dimensional unit cube. We first derive an upper bound on the…

Gromov showed that (1993) with high probability, every bounded and reduced van Kampen diagram $D$ of a random group at density $d$ satisfies the isoperimetric inequality $|\partial D|\geq (1-2d-s)|D|\ell$. In this article, we adapt…

Let $G$ be a random group in Gromov's density model $G(m,d,L)$ with $d<\tfrac12$. We prove a sharp quantitative constraint on products of conjugates equal to the identity: for every $n\ge1$ and $\varepsilon>0$, with overwhelming probability…

We study the emergence of loose Hamilton cycles in subgraphs of random hypergraphs. Our main result states that the minimum $d$-degree threshold for loose Hamiltonicity relative to the random $k$-uniform hypergraph $H_k(n,p)$ coincides with…

Let $X$ be a connected scheme, smooth and separated over an algebraically closed field $k$ of characteristic $p\geq 0$, let $f:Y\rightarrow X$ be a smooth proper morphism and $x$ a geometric point on $X$. We prove that the tensor invariants…

Given an undirected, edge-weighted graph G together with pairs of vertices, called pairs of terminals, the minimum multicut problem asks for a minimum-weight set of edges such that, after deleting these edges, the two terminals of each pair…

Let m(G) be the maximum number of vertex-disjoint odd cycles of a graph G and t(G) the minimum number of vertices whose removal makes G bipartite. We show that t(G)<=6m(G) if G is planar. This improves the previous bound t(G)<=10m(G) by…

For graphs $F$ and $G$, let $F\to G$ signify that any red/blue edge coloring of $F$ contains a monochromatic $G$. Denote by ${\cal G}(N,p)$ the random graph space of order $N$ and edge probability $p$. Using the regularity method, one can…