Related papers: 3-nets realizing a diassociative loop in a project…

We prove that if a family of compact connected sets in the plane has the property that every three members of it are intersected by a line, then there are three lines intersecting all the sets in the family. This answers a question of…

Let $P$ be a set of $n \geq 5$ points in convex position in the plane. The path graph $G(P)$ of $P$ is an abstract graph whose vertices are non-crossing spanning paths of $P$, such that two paths are adjacent if one can be obtained from the…

Alignable nets are grid structures that can collapse to a planar strip, which is in fact the real-world counterpart of a curve. This property simplifies on-site assembly and enables compact transport and storage. These grid structures can…

This paper is a survey of some of the most elementary consequences of the JSJ-decomposition and geometrization for knot and link complements in the 3-sphere. Formulated in the language of graphs, the result is the construction of a…

An $(n_3)$ configuration is an incidence structure equivalent to a linear hypergraph on $n$ vertices which is both 3-regular and 3-uniform. We investigate a variant in which one constraint, say 3-regularity, is present, and we allow exactly…

We study compact orientable essential surfaces in knot exteriors in the 3-sphere. The genus $g$, the number of boundary components $b$, and the boundary slope $p/q$ are fundamental invariants of an essential surface. The \textit{realization…

The crossing number of a graph $G$ in a surface $\Sigma$, denoted by $cr_{\Sigma}(G)$, is the minimum number of pairwise intersections of edges in a drawing of $G$ in $\Sigma$. Let $k$ be an integer satisfying $k\geq 3$, the generalized…

We study the problem of classifying the lines of the projective $3$-space $PG(3,q)$ over a finite field $GF(q)$ into orbits of the group $G=PGL(2,q)$ of linear symmetries of the twisted cubic $C$. A generic line neither intersects $C$ nor…

Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. The objective of this paper is to study how to obtain $3$-designs with $2$-transitive permutation groups. The incidence…

Hasunuma [J. Graph Theory 102 (2023) 423-435] conjectured that for any tree $T$ of order $m$, every $k$-connected (or $k$-edge-connected) graph $G$ with minimum degree at least $k+m-1$ contains a tree $T'\cong T$ such that $G-E(T')$ is…

Data describing the three-dimensional structure of physical networks is increasingly available, leading to a surge of interest in network science to explore the relationship between the shape and connectivity of physical networks. We…

We introduce and study the {\em orderly spanning trees} of plane graphs. This algorithmic tool generalizes {\em canonical orderings}, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning…

In this paper the correspondence between safe Petri nets and event structures, due to Nielsen, Plotkin and Winskel, is extended to arbitrary nets without self-loops, under the collective token interpretation. To this end we propose a more…

In this article we exhibit certain projective degenerations of smooth $K3$ surfaces of degree $2g-2$ in $\Bbb P^g$ (whose Picard group is generated by the hyperplane class), to a union of two rational normal scrolls, and also to a union of…

We consider the complexity of the recognition problem for two families of combinatorial structures. A graph $G=(V,E)$ is said to be an intersection graph of lines in space if every $v\in V$ can be mapped to a straight line $\ell (v)$ in…

An ordinary plane of a finite set of points in real 3-space with no three collinear is a plane intersecting the set in exactly three points. We prove a structure theorem for sets of points spanning few ordinary planes. Our proof relies on…

Let $P$ be a set of $n$ points in the plane. A crossing-free structure on $P$ is a plane graph with vertex set $P$. Examples of crossing-free structures include triangulations of $P$, spanning cycles of $P$, also known as polygonalizations…

The intersection graph of a group $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H$…

We classify representations of the mapping class group of a surface of genus $g$ (with at most one puncture or boundary component) up to dimension $3g-3$. Any such representation is the direct sum of a representation in dimension $2g$ or…

In this paper we generalize several results on separated nets in Euclidean space to separated nets in connected simply connected nilpotent Lie groups. We show that every such group $G$ contains separated nets that are not biLipschitz…