Related papers: Ovals and Hyperovals in Desarguesian Nets

For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…

This paper introduces advances in the geometry of the transforms for cross ratio of four points in a line in the Desargues affine plane. The results given here have a clean, based Desargues affine plan axiomatic and definitions of addition…

Network motifs are characteristic patterns which occur in the networks essentially more frequently than the other patterns. For five motifs found in S. Itzkovitz, U. Alon, Phys. Rev.~E, 2005, 71, 026117-1, hierarchical random graphs are…

We show a somewhat surprising result: if $E$ is a disk in the plane $\mathbb R^2$, then there is a homeomorphism $h:\mathbb R^2\rightarrow\mathbb R^2$ such that, for every $x\in\partial E$, the orbit $O(x, h)$ is bounded, but for every…

A \textit{$3$-net} of order $n$ is a finite incidence structure consisting of points and three pairwise disjoint classes of lines, each of size $n$, such that every point incident with two lines from distinct classes is incident with…

S. Rottey and G. Van de Voorde characterized regular pseudo-ovals of PG(3n - 1, q), q = 2^h, h >1 and n prime. Here an alternative proof is given and slightly stronger results are obtained.

Considering regular graphs with every edge in a triangle we prove lower bounds for the number of triangles in such graphs. For r-regular graphs with r <= 5 we exhibit families of graphs with exactly that number of triangles and then…

Borradaile, Le and Sherman-Bennett [Graphs and Combinatorics, 2017] proved that every $n$-vertex $2$-outerplane graph has a set of at least $2n/3$ vertices that induces an outerplane graph. We identify a major flaw in their proof and…

The Lagrangian density of an $r$-uniform hypergraph $F$ is $r!$ multiplying the supremum of the Lagrangians of all $F$-free $r$-uniform hypergraphs. For an $r$-graph $H$ with $t$ vertices, it is clear that $\pi_{\lambda}(H)\ge…

Ryser's conjecture says that for every $r$-partite hypergraph $H$ with matching number $\nu(H)$, the vertex cover number is at most $(r-1)\nu(H)$. This far reaching generalization of K\"onig's theorem is only known to be true for $r\leq 3$,…

Call {\em i-hedrite} any 4-valent n-vertex plane graph, whose faces are 2-, 3- and 4-gons only and $p_2+p_3=i$. The edges of an i-hedrite, as of any Eulerian plane graph, are partitioned by its {\em central circuits}, i.e. those, which are…

We present explicit descriptions of the decompositions of vertices of a hypercube graph with respect to its distinguished symmetric cycle.

This paper gives a uniform, self-contained and direct approach to a variety of obstruction-theoretic problems on manifolds of dimension 7 and 6. We give necessary and sufficient cohomological criteria for the existence of various…

We review the theory of orthogonal separation of variables on pseudo-Riemannian manifolds of constant non-zero curvature via concircular tensors and warped products. We then apply this theory simultaneously to both the three-dimensional…

In this paper, we extend the uniqueness theorem for meromorphic mappings to the case where the family of hyperplanes depends on the meromorphic mapping and where the meromorphic mappings may be degenerate.

The focus is on circular nets with one or two families of spherical parameter lines, which are treated in M\"obius geometry. These circular nets provide a discretisation of surfaces with one or two families of spherical curvature lines. The…

We determine the versal deformation of cones, in the simplest case: cones over hyperelliptic curves of high degree. In particular, we show that for degree $4g+4$, the highest degree for which interesting deformations exist, the number of…

In this paper we study underlying graphs corresponding to a set of halving lines. We establish many properties of such graphs. In addition, we tighten the upper bound for the number of halving lines.

There are two particular $\Theta_6$-graphs - the 6-cycle graphs with a diagonal. We find the planar Tur\'an number of each of them, i.e. the maximum number of edges in a planar graph $G$ of $n$ vertices not containing the given $\Theta_6$…

If ${\cal H}=(V,{\cal E})$ is a hypergraph, its edge intersection hypergraph $EI({\cal H})=(V,{\cal E}^{EI})$ has the edge set ${\cal E}^{EI}=\{e_1 \cap e_2 \ |\ e_1, e_2 \in {\cal E} \ \wedge \ e_1 \neq e_2 \ \wedge \ |e_1 \cap e_2…