Related papers: Linearizable 3-webs and the Gronwall conjecture

Let W be a planar 3-web defined on a neighborhood of a point M. We call "symmetry of W around M" any local diffeomorphism which fixes M and maps each foliation of W to a (not necessarily the same) foliation of W. We say that it is a simple…

We present two proofs that all closed, orientable 3-manifolds are parallelisable. Both are based on the Lickorish-Wallace surgery presentation; one proof uses a refinement due to Kaplan and some basic contact geometry. This complements a…

A recent lower bound on the number of edges in a k-critical n-vertex graph by Kostochka and Yancey yields a half-page proof of the celebrated Gr\"otzsch Theorem that every planar triangle-free graph is 3-colorable. In this paper we use the…

The linear isometries between weighted Banach spaces of continuous functions are considered. Some of well known theorems on isometries between spaces of continuous functions are proved and stated, but all they are in an appropriate form. In…

Given a bipartite graph $G=(V_b,V_r,E)$, the $2$-Level Quasi-Planarity problem asks for the existence of a drawing of $G$ in the plane such that the vertices in $V_b$ and in $V_r$ lie along two parallel lines $\ell_b$ and $\ell_r$,…

There is a remarkable connection between the maximum clique number and the Lagrangian of a graph given by T. S. Motzkin and E.G. Straus in 1965. This connection and its extensions were successfully employed in optimization to provide…

Let $G$ be a bridgeless cubic graph. In 2023, the three authors solved a conjecture (also known as the $S_4$-Conjecture) made by Mazzuoccolo in 2013: there exist two perfect matchings of $G$ such that the complement of their union is a…

We study cospectral vertices on finite graphs in relation to the echolocation problem on Riemannian manifolds. First, We prove a computationally simple criterion to determine whether two vertices are cospectral. Then, we use this criterion…

We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.

We explore the rigidity of generic frameworks in 3-dimensions whose underlying graph is close to being planar. Specifically we consider apex graphs, edge-apex graphs and their variants and prove independence results in the generic…

We investigate the question of which graphs have planar emulators (a locally-surjective homomorphism from some finite planar graph) -- a problem raised already in Fellows' thesis (1985) and conceptually related to the better known planar…

A nonplanar graph G is called almost-planar if for every edge e of G, at least one of G\e and G/e is planar. In 1990, Gubser characterized 3-connected almost-planar graphs in his dissertation. However, his proof is so long that only a small…

Based on the analogy between knots and primes, J. Hillman, D. Matei and M. Morishita defined the Iwasawa invariants for sequences of cyclic covers of links with an analogue of Iwasawa's class number formula of number fields. In this paper,…

We prove that the second derived subdivision of any rectilinear triangulation of any convex polytope is shellable. Also, we prove that the first derived subdivision of every rectilinear triangulation of any convex 3-dimensional polytope is…

This note outlines the realizable extension problem for weighted graphs and provides results of a detailed analysis of this problem for the weighted graph $(K_{3,3},l)$. This analysis is then utilized to provide a result relating to the…

We compare two natural bases for the invariant space of a tensor product of irreducible representations of A_2, or sl(3). One basis is the web basis, defined from a skein theory called the combinatorial A_2 spider. The other basis is the…

A classification and examples of four-dimensional isoclinic three-webs of codimension two are given. The examples considered prove the existence theorem for many classes of webs for which the general existence theorems are not proved yet.

We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: "globally noncrossing" graphs, which avoid crossings in all of their configurations; matchstick graphs,…

In 2003, it was claimed that the following problem was solvable in polynomial time: do there exist k edge-disjoint paths of length exactly 3 between vertices s and t in a given graph? The proof was flawed, and we show that this problem is…

We discuss the curvilinear web $\boldsymbol{\mathcal W}_{0,n+3}$ on the moduli space $\mathcal M_{0,n+3}$ of projective configurations of $n+3$ points on $\mathbf P^1$ defined by the $n+3$ forgetful maps $\mathcal M_{0,n+3}\rightarrow…