Related papers: Sur la conjecture abc, version corps de fonctions …

It is an intriguing question to see what kind of information on the structure of an oriented graph $D$ one can obtain if $D$ does not contain a fixed oriented graph $H$ as a subgraph. The related question in the unoriented case has been an…

Let $\mathcal{D}$ be a set of straight-line segments in the plane, potentially crossing, and let $c$ be a positive integer. We denote by $P$ the union of the endpoints of the straight-line segments of $\mathcal{D}$ and of the intersection…

We apply the Discharging Method to prove the 1,2,3-Conjecture and the 1,2-Conjecture for graphs with maximum average degree less than 8/3. Stronger results on these conjectures have been proved, but this is the first application of…

We characterize all orientations of cycles $C$ for which for every fixed $\varepsilon > 0$ there exists a constant $c \geq 1$ such that every digraph $D$ without loops or parallel arcs with $\chi(D) \geq c$ and minimum out-degree at least…

A digraph is strongly connected if it has a directed path from $x$ to $y$ for every ordered pair of distinct vertices $x, y$ and it is strongly $k$-connected if it has at least $k+1$ vertices and remains strongly connected when we delete…

We prove that for every nowhere dense class of graphs $\mathcal{C}$, positive integer $d$, and $\varepsilon>0$, the following holds: in every $n$-vertex graph $G$ from $\mathcal{C}$ one can find two disjoint vertex subsets $A,B\subseteq…

Let $G=(V,E)$ be a simple graph with $|V|=n$ nodes and $|E|=m$ links, a subset $K \subseteq V$ of \emph{terminals}, a vector $p=(p_1,\ldots,p_m) \in [0,1]^m$ and a positive integer $d$, called \emph{diameter}. We assume nodes are perfect…

The dicycle transversal number t(D) of a digraph D is the minimum size of a dicycle transversal of D, i. e. a set T of vertices of D such that D-T is acyclic. We study the following problem: Given a digraph D, decide if there is a dicycle B…

Christoph, Dragani\'{c}, Gir\~{a}o, Hurley, Michel, and M\"{u}yesser conjectured that, when $d\mid n$, the expected number of cycles in a uniformly random cycle-factor of a directed $d$-regular graph on $n$ vertices is uniquely maximised by…

Using the celebrated Witten-Kontsevich theorem, we prove a recursive formula of the $n$-point functions for intersection numbers on moduli spaces of curves. It has been used to prove the Faber intersection number conjecture and motivated us…

In this paper, we address the Ehrenborg's conjecture which proposes that for any bipartite graph the number of spanning trees does not exceed the product of the degrees of the vertices divided by the product of the sizes of the graph…

Fix integers $r\geq 4$ and $i\geq 2$. Let $C$ be a non-degenerate, reduced and irreducible complex projective curve in $\mathbb P^r$, of degree $d$, not contained in a hypersurface of degree $\leq i$. Let $p_a(C)$ be the arithmetic genus of…

In this paper, we prove an intersection-theoretic result pertaining to curves in certain Hilbert modular surfaces in positive characteristic. Specifically, we show that given two appropriate curves C,D parameterizing abelian surfaces with…

Consider a bipartite random geometric graph on the union of two independent homogeneous Poisson point processes in $d$-space, with distance parameter $r$ and intensities $\lambda,\mu$. We show for $d \geq 2$ that if $\lambda$ is…

We prove that rationally connected varieties over the function field of a complex curve satisfy weak approximation for places of good reduction.

We consider correlation functions in 6d $(2,0)$ theories of two $\frac{1}{2}$-BPS operators inserted away from a $\frac{1}{2}$-BPS surface defect. In the large central charge limit the leading connected contribution corresponds to sums of…

The multiplicity of an algebraic curve $C$ in the complex plane at a point $p$ on that curve is defined as the number of points that occur at the intersection of $C$ with a general complex line that passes close to the point $p$. It is…

In this paper we explicitly estimate the number of points in a subset $A \subset \R^{d}$ as a function of the maximum angle $\angle A$ that any three of these points form, provided $\angle A < \theta_d := \arccos(-\frac 1 {d}) \in…

We show that the geometric classification of smooth projective curves admitting infinitely many points of degree $d\leq 5$ extends from number fields to function fields of characteristic 0. Over number fields, this classification was…

We give a new, geometric proof of the section conjecture for fixed points of finite group actions on projective curves of positive genus defined over the field of complex numbers, as well as its natural nilpotent analogue. As a part of our…