Related papers: Universality for random surfaces in unconstrained …

The graph complex acts on the spaces of Poisson bi-vectors $P$ by infinitesimal symmetries. We prove that whenever a Poisson structure is homogeneous, i.e. $P = L_{\vec{V}}(P)$ w.r.t. the Lie derivative along some vector field $\vec{V}$,…

We show that, for every n and every surface $\Sigma$, there is a graph U embeddable on $\Sigma$ with at most cn^2 vertices that contains as minor every graph embeddable on $\Sigma$ with n vertices. The constant c depends polynomially on the…

We generalize Iskovskih's theorem about surfaces without irregularity and bigenus from the smooth case to regular surfaces over arbitrary fields, with special focus on the case of imperfect fields. This includes surfaces that are…

We show that the universal homogeneous partial order has finite big Ramsey degrees and discuss several corollaries. Our proof relies on parameter spaces and the Carlson-Simpson theorem rather than on (a strengthening of) the…

We prove that the spectral radius of a large random matrix $X$ with independent, identically distributed complex entries follows the Gumbel law irrespective of the distribution of the matrix elements. This solves a long-standing conjecture…

We prove asymptotically optimal bounds on the number of edges a graph $G$ must have in order that any $r$-colouring of $E(G)$ has a colour class which contains every $D$-degenerate graph on $n$ vertices with bounded maximum degree. We also…

We consider a random geometric graph $G(\chi_n, r_n)$, given by connecting two vertices of a Poisson point process $\chi_n$ of intensity $n$ on the unit torus whenever their distance is smaller than the parameter $r_n$. The model is…

We consider the problem of decomposing the edges of a digraph into as few paths as possible. A natural lower bound for the number of paths in any path decomposition of a digraph $D$ is $\frac{1}{2}\sum_{v\in V(D)}|d^+(v)-d^-(v)|$; any…

Twisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al. showed that when the two instances are independent, these…

The main objects under consideration in this thesis are called maps, a certain class of graphs embedded on surfaces. Our problems have a powerful relatively recent tool in common, the so-called topological recursion (TR) introduced by…

A method is presented for constructing closed surfaces out of Euclidean polygons with infinitely many segment identifications along the boundary. The metric on the quotient is identified. A sufficient condition is presented which guarantees…

Let $\{D_M\}_{M\geq 0}$ be the $n$-vertex random directed graph process, where $D_0$ is the empty directed graph on $n$ vertices, and subsequent directed graphs in the sequence are obtained by the addition of a new directed edge uniformly…

In the paper "Formality conjecture" (1996) Kontsevich designed a universal flow $\dot{\mathcal{P}}=\mathcal{Q}_{a:b}(\mathcal{P})=a\Gamma_{1}+b\Gamma_{2}$ on the spaces of Poisson structures $\mathcal{P}$ on all affine manifolds of…

We consider the problem of sampling an edge almost uniformly from an unknown graph, $G = (V, E)$. Access to the graph is provided via queries of the following types: (1) uniform vertex queries, (2) degree queries, and (3) neighbor queries.…

We prove that any quasirandom graph with $n$ vertices and $rn$ edges can be decomposed into $n$ copies of any fixed tree with $r$ edges. The case of decomposing a complete graph establishes a conjecture of Ringel from 1963.

We prove the universality of correlation functions of chiral unitary and unitary ensembles of random matrices in the microscopic limit. The essence of the proof consists in reducing the three-term recursion relation for the relevant…

We confirm the eventual evasiveness of several classes of monotone graph properties under widely accepted number theoretic hypotheses. In particular we show that Chowla's conjecture on Dirichlet primes implies that (a) for any graph $H$,…

We give a combinatorial proof, using the hyperbolicity of the curve graphs, of the bounded geodesic image theorem of Masur and Minsky. Recently it has been shown that curve graphs are uniformly hyperbolic, thus a universal bound can be…

We consider closed manifolds that admit a metric locally isometric to a product of symmetric planes. For such manifolds, we prove that the Euler characteristic is an obstruction to the existence of flat structures, confirming an old…

In this paper, we apply the Turan sieve and the simple sieve developed by R. Murty and the first author to study problems in random graph theory. In particular, we obtain upper and lower bounds on the probability of a graph on n vertices…