Related papers: The Maschke octic contains 96 pairwise disjoint li…

We prove that a smooth plane sextic curve can have at most 72 tritangents, whereas a smooth real sextic may have at most 66 real tritangents.

The {\em planar Tur\'{a}n number} of $H$, denoted by $ex_{\mathcal{P}}(n,H)$, is the maximum number of edges in an $H$-free planar graph. The planar Tur\'{a}n number of $k\geq 3$ vertex-disjoint union of cycles is a trivial value $3n-6$.…

We show that the maximal number of (real) lines in a (real) nonsingular spatial quartic surface is 64 (respectively, 56). We also give a complete projective classification of all quartics containing more than 52 lines: all such quartics are…

We prove that a reduced and irreducible algebraic surface in $\mathbb{CP}^{3}$ containing infinitely many twistor lines cannot have odd degree. Then, exploiting the theory of quaternionic slice regularity and the normalization map of a…

Let $d \geq 3$ be an integer. It is known that the number of edges of the edge polytope of the complete graph with $d$ vertices is $d(d-1)(d-2)/2$. In this paper, we study the maximum possible number $\mu_d$ of edges of the edge polytope…

A mixed graph $G$ can contain both (undirected) edges and arcs (directed edges). Here we derive an improved Moore-like bound for the maximum number of vertices of a mixed graph with diameter at least three. Moreover, a complete enumeration…

We show that given a collection of A lines in \R^n, n\geq 2, the maximum number of their joints (points incident to at least n lines whose directions form a linearly independent set) is O(A^{n/(n-1)}). An analogous result for smooth…

In the Disjoint Paths problem, one is given a graph with a set of $k$ vertex pairs $(s_i,t_i)$ and the task is to connect each $s_i$ to $t_i$ with a path, so that the $k$ paths are pairwise disjoint. In the optimization variant, Max…

The purpose of this note is to provide some applications of Faltings' recent proof of S. Lang's conjecture to smooth plane curves. Let $C$ be a smooth plane curve defined by an equation of degree $d$ with integral coefficients. We show that…

We show that any $2-$factor of a cubic graph can be extended to a maximum $3-$edge-colorable subgraph. We also show that the sum of sizes of maximum $2-$ and $3-$edge-colorable subgraphs of a cubic graph is at least twice of its number of…

We prove that a K3 quartic surface defined over a field of characteristic 2 can contain at most 68 lines. If it contains 68 lines, then it is projectively equivalent to a member of a 1-dimensional family found by Rams and Sch\"utt.

A connected graph $G$ with at least two vertices is matching covered if each of its edges lies in a perfect matching. A matching covered graph is minimal if the removal of any edge results in a graph that is no longer matching covered. An…

We study noncrossing geometric graphs and their disjoint compatible geometric matchings. Given a cycle (a polygon) P we want to draw a set of pairwise disjoint straight-line edges with endpoints on the vertices of P such that these new…

A special case of a conjecture by Thomass\'e is that any oriented graph with minimum outdegree k contains a dipath of length 2k. For the sake of proving whether or not a counterexample exists, we present reductions and establish bounds on…

We improve our earlier upper bound on the numbers of antipodal pairs of points among $n$ points in ${\mathbb{R}}^3$, to $2n^2/5+O(n^c)$, for some $c<2$. We prove that the minimal number of antipodal pairs among $n$ points in convex position…

We study extremal type problem arising from the question: What is the maximum number of edge-disjoint non-crossing perfect matchings on a set S of 2n points in the plane such that their union is a triangle-free geometric graph? We approach…

Let M be a compact connected orientable 3-manifold, with non-empty boundary that contains no 2-spheres. We investigate the existence of two properly embedded disjoint surfaces S_1 and S_2 such that M - (S_1 \cup S_2) is connected. We show…

We prove the sharp bound of at most 64 lines on complex projective quartic surfaces (resp. affine quartics) that are not ruled by lines. We study configurations of lines on certain non-K3 surfaces of degree four and give various examples of…

We study the following question: fix a sufficient general curve D of degree d in P^2, what is the least number of intersections between D and an irreducible curve of degree m? G. Xu proved this number i(d, m) is at least d - 2 for all m.…

We study the number of edge-disjoint Hamilton cycles one can guarantee in a sufficiently large graph G on n vertices with minimum degree d = (1/2+a)n. For any constant a > 0, we give an optimal answer in the following sense: let…