相关论文: Covers of Point-Hyperplane Graphs

It is well known that 3--regular graphs with arbitrarily large girth exist. Three constructions are given that use the former to produce non-Hamiltonian 3--regular graphs without reducing the girth, thereby proving that such graphs with…

We investigate a class of odd (ramification) coverings $C \to \mathbb{P}^1$ where $C$ is hyperelliptic, its Weierstrass points maps to one fixed point of $\mathbb{P}^1$ and the covering map makes the hyperelliptic involution of $C$ commute…

Let $X$ be a cubic hypersurface in $\mathbb P^6$ or a hypersurface of degree greater than equal to $7$ in $\mathbb P^5$. In this note we try to understand, for a very general hyperplane section of $X$, the non-injectivity locus of the…

We show that any hyperplane section of a variety which is the inverse image of a smooth variety of dimension at least 2 by an endomorphism (wich is not an automorphism) of the projective space, is linearly complete. We stress the case of…

We determine conditions that guarantee that a hyperelliptic or plane curve over a field of characteristic not equal to 2 can be defined over its field of moduli. We also give new examples of curves not definable over their fields of moduli.

A graph is $k$-planar if it can be drawn in the plane such that no edge is crossed more than $k$ times. While for $k=1$, optimal $1$-planar graphs, i.e., those with $n$ vertices and exactly $4n-8$ edges, have been completely characterized,…

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this note we give examples of class two 1-planar graphs with maximum degree six or seven.

In this paper a generalisation of the notion of polarity is exhibited which allows to completely describe, in an incidence-geometric way, the linear complexes of $h$-subspaces. A generalised polarity is defined to be a partial map which…

Using Fourier analysis, Covert, Hart, Iosevich and Uriarte-Tuero (2008) showed that if the cardinality of a subset of the 2-dimensional vector space over a finite field with q elements is >= rq^2, with q^{-1/2} << r <= 1 then it contains an…

Almost $4$-connectivity is a weakening of $4$-connectivity which allows for vertices of degree three. In this paper we prove the following theorem. Let $G$ be an almost $4$-connected triangle-free planar graph, and let $H$ be an almost…

We prove the non-rationality of a double cover of $\mathbb{P}^{n}$ branched over a hypersurface $F\subset\mathbb{P}^{n}$ of degree $2n$ having isolated singularities such that $n\ge 4$ and every singular points of the hypersurface $F$ is…

We give divisibility results for the (global) characteristic varieties of hypersurface complements expressed in terms of the local characteristic varieties at points along one of the irreducible components of the hypersurface. As an…

Let $V$ be a finite set of vertices in the plane and $S$ be a finite set of polygonal obstacles, where the vertices of $S$ are in $V$. We show how to construct a plane $2$-spanner of the visibility graph of $V$ with respect to $S$. As this…

In this work, we investigate the behaviour of the covering gonality of a very general hypersurface in a product of projective spaces. Inspired by the work of Bastianelli, Ciliberto, Flamini and Suppino in [BCFS19] which addresses the case…

We construct a family F of compact and pathwise connected subsets of the Euclidean plane such that (i) the cardinality of F is that of the continuum (and hence extremely large) and (ii) if X,Y are distinct spaces in F then there never…

Motivated by hybrid graph representations, we introduce and study the following beyond-planarity problem, which we call $h$-Clique2Path Planarity: Given a graph $G$, whose vertices are partitioned into subsets of size at most $h$, each…

Let $L_n$ be a line graph with $n$ edges and $\F(L_n)$ the facet ideal of its matching complex. In this paper, we provide the irreducible decomposition of $\F(L_n)$ and some exact formulas for the projective dimension and the regularity of…

Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…

We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices…

We introduce the notion of a combinatorial $n$-od cover, for $n \geq 3$, which is a tool that may be used to show that certain continua embedded in the plane are not simple $n$-od-like. Using this tool, we generalize a classic example of…