Related papers: A Viro Theorem without convexity hypothesis for tr…

The work provides a brief intuitive overview theory of graph on surfaces. We considers graphs with an additional structure, wich we call discs with ribbons, also known as one-vertex ribbon graphs. And solves the problem (Skopenkov's) about…

The implicit representation conjecture concerns hereditary families of graphs. Given a graph in such a family, we want to assign some string of bits to each vertex in such a way that we can recover the information about whether 2 vertices…

Let $X$ be a smooth algebraic curve. Suppose that there exists a triple covering $f : X \to Y$ where $Y$ is a smooth algebraic curve. In this paper, we investigate the existence of morphisms from $X$ to the projective line $\mathbf{P}^1$…

In this paper we have shown without assuming the four color theorem of planar graphs that every (bridgeless) cubic planar graph has a three-edge-coloring. This is an old-conjecture due to Tait in the squeal of efforts in settling the…

Consider a random geometric graph $G$ with a vertex set defined by a Poisson point process with intensity $t>0$ in a convex body. We can generate a drawing of the graph by projecting the construction onto some plane $L$. Choosing different…

Let $r \ge 3$ be fixed and $G$ be an $n$-vertex graph. A long-standing conjecture of Gy\H{o}ri states that if $e(G) = t_{r-1}(n) + k$, where $t_{r-1}(n)$ denotes the number of edges of the Tur\'{a}n graph on $n$ vertices and $r - 1$ parts,…

By the theorem of Mantel $[5]$ it is known that a graph with $n$ vertices and $\lfloor \frac{n^{2}}{4} \rfloor+1$ edges must contain a triangle. A theorem of Erd\H{o}s gives a strengthening: there are not only one, but at least…

The Evasiveness conjecture have been proved for properties of graphs on a prime-power number of vertices and the six vertices case. The ten vertices case is still unsolved. In this paper we study the size of the automorphism group of a…

Let X be a projective variety which is covered by rational curves, for instance a Fano manifold over the complex numbers. In this setup, characterization and classification problems lead to the natural question: "Given two points on X, how…

Let X be a (possibly nodal) K-trivial threefold moving in a fixed ambient space P. Suppose X contains a continuous family of curves, all of whose members satisfy certain unobstructedness conditions in P. A formula is given for computing the…

Following ideas of V. Batyrev, we prove an analogue of the Cone Theorem for the closed cone of nef curves: an enlargement of the cone of nef curves is the closure of the sum of a K_X-non-negative portion and countably many K_X-negative…

Itenberg and Shustin's pseudoholomorphic curve patchworking is in principle more flexible than Viro's original algebraic one. It was natural to wonder if the former method allows one to construct non-algebraic objects. In this paper we…

We prove that for every graph $H$, there exists $\varepsilon>0$ such that every $n$-vertex graph with no vertex-minors isomorphic to $H$ has a pair of disjoint sets $A$, $B$ of vertices such that $|A|, |B|\ge \varepsilon n$ and $A$ is…

We prove a warped product splitting theorem for manifolds with Ricci curvature bounded from below in the spirit of [Croke-Kleiner, \emph{Duke Math.\;J}.\;(1992)], but instead of asking that one boundary component is compact and mean-convex,…

Tuza's Conjecture states that if a graph $G$ does not contain more than $k$ edge-disjoint triangles, then some set of at most $2k$ edges meets all triangles of $G$. We prove Tuza's Conjecture for all graphs $G$ having no subgraph with…

We characterize contractible curves on proper normal algebraic surfaces in terms of complementary Weil divisors. Using this we generalize the classical criteria of Castelnuovo and Artin. As application we derive a finiteness result on…

We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem---to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph---and…

A minimal counterexample to the Erd\H{o}s-Gy\'arf\'as conjecture is a graph of minimum possible order and size with minimum degree at least 3 that contains no cycle whose length is a power of 2. Markstr\"om observed that any such graph must…

This is the text of my lecture (in french) at the Bourbaki Seminar (november 2003) on the proof by Claire Voisin of the Green conjecture for a generic curve. This conjecture predicts the structure of the minimal resolution of the ideal of a…

We completely describe the Brill-Noether theory for curves in the primitive linear system on generic abelian surfaces, in the following sense: given integers $d$ and $r$, consider the variety $V^r_d(|H|)$ parametrizing curves $C$ in the…