Related papers: The extremal number of surfaces

Let $f^{(r)}(n;s,k)$ denote the maximum number of edges in an $r$-graph on $n$ vertices in which every $k$ edges span more than $s$ vertices. Brown, Erd\H{o}s and S\'{o}s in 1973 conjectured that for every $k\geq 2$, the limit…

We prove that in every $2$-edge-colouring of $K_n$ there is a collection of $n^2/12 + o(n^2)$ edge-disjoint monochromatic triangles, thus confirming a conjecture of Erd\H{o}s. We also prove a corresponding stability result, showing that…

We prove existence of thick geodesic triangulations of hyperbolic 3-manifolds and use this to prove existence of universal bounds on the principal curvatures of surfaces embedded in hyperbolic 3-manifolds.

It is shown that for a constant $t\in \mathbb{N}$, every simple topological graph on $n$ vertices has $O(n)$ edges if it has no two sets of $t$ edges such that every edge in one set is disjoint from all edges of the other set (i.e., the…

In the 1960s, Erd\H{o}s and his cooperators initiated the research of the maximum numbers of edges in a graph or a planar graph on $n$ vertices without $k$ edge-disjoint cycles. This problem had been solved for $k\leq4$. As pointed out by…

Using the formalism of flag algebras, we prove that every triangle-free graph $G$ with $n$ vertices contains at most $(n/5)^5$ cycles of length five. Moreover, the equality is attained only when $n$ is divisible by five and $G$ is the…

In 1974, Erd\H{o}s posed the following problem. Given an oriented graph $H$, determine or estimate the maximum possible number of $H$-free orientations of an $n$-vertex graph. When $H$ is a tournament, the answer was determined precisely…

A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the surface. In this work we propose an algorithm that constructs the set of irreducible triangulations of any surface with…

We generalize the notions of flippable and simultaneously flippable edges in a triangulation of a set S of points in the plane to so-called \emph{pseudo-simultaneously flippable edges}. Such edges are related to the notion of convex…

We use an algebraic method to prove a degree version of the celebrated Erd\H os-Ko-Rado theorem: given $n>2k$, every intersecting $k$-uniform hypergraph $H$ on $n$ vertices contains a vertex that lies on at most $\binom{n-2}{k-2}$ edges.…

A theorem of Nosal and Nikiforov states that if $G$ is a triangle-free graph with $m$ edges, then $\lambda (G)\le \sqrt{m}$, where the equality holds if and only if $G$ is a complete bipartite graph. A well-known spectral conjecture of…

A longstanding conjecture of Erd\H{o}s and Simonovits states that for every rational $r$ between $1$ and $2$ there is a graph $H$ such that the largest number of edges in an $H$-free graph on $n$ vertices is $\Theta(n^r)$. Answering a…

The Erd\H{o}s--Hajnal Theorem asserts that non-universal graphs, that is, graphs that do not contain an induced copy of some fixed graph $H$, have homogeneous sets of size significantly larger than one can generally expect to find in a…

Let $(S,H)$ be a general primitively polarized $K3$ surface of genus $\p$ and let $p_a(nH)$ be the arithmetic genus of $nH.$ We prove the existence in $|\mathcal O_S(nH)|$ of curves with a triple point and $A_k$-singularities. In…

An $r$-uniform tight cycle of length $\ell>r$ is a hypergraph with vertices $v_1,\dots,v_\ell$ and edges $\{v_i,v_{i+1},\dots,v_{i+r-1}\}$ (for all $i$), with the indices taken modulo $\ell$. It was shown by Sudakov and Tomon that for each…

For two integers $k$ and $\ell$, an $(\ell \text{ mod }k)$-cycle means a cycle of length $m$ such that $m\equiv \ell\pmod{k}$. In 1977, Bollob\'{a}s proved a conjecture of Burr and Erd\H{o}s by showing that if $\ell$ is even or $k$ is odd,…

We prove that any $n$-vertex graph whose complement is triangle-free contains $n^2/12-o(n^2)$ edge-disjoint triangles. This is tight for the disjoint union of two cliques of order $n/2$. We also prove a corresponding stability theorem, that…

We prove that any non-isotrivial elliptic K3 surface over an algebraically closed field $k$ of arbitrary characteristic contains infinitely many rational curves. In the case when $\mathrm{char}(k)\neq 2,3$, we prove this result for any…

Tuza conjectured that for every graph $G$, the maximum size $\nu$ of a set of edge-disjoint triangles and minimum size $\tau$ of a set of edges meeting all triangles satisfy $\tau \leq 2\nu$. We consider an edge-weighted version of this…

Suppose an orientation preserving action of a finite group $G$ on the closed surface $\Sigma_g$ of genus $g>1$ extends over the 3-torus $T^3$ for some embedding $\Sigma_g\subset T^3$. Then $|G|\le 12(g-1)$, and this upper bound $12(g-1)$…