Related papers: Flip-Flop Sublinear Models for Graphs: Proof of Th…

For all $k \geq 1$, we show that deciding whether a graph is $k$-planar is NP-complete, extending the well-known fact that deciding 1-planarity is NP-complete. Furthermore, we show that the gap version of this decision problem is…

We study algebraic varieties parametrized by topological spaces and enlarge the domains of Lawson homology and morphic cohomology to this category. We prove a Lawson suspension theorem and splitting theorem. A version of Friedlander-Lawson…

For a graph $G$, let $f_2(G)$ denote the largest number of vertices in a $2$-regular subgraph of $G$. We determine the minimum of $f_2(G)$ over $3$-regular $n$-vertex simple graphs $G$. To do this, we prove that every $3$-regular multigraph…

On one hand, we study the class of graphs on surfaces, satisfying tessellation properties, with positive Forman curvature on each edge. Via medial graphs, we provide a new proof for the finiteness of the class, and give a complete…

We prove that there does not exist any semi-parallel real hypersurface in complex two-plane Grassmannians. With this result, the nonexistence of recurrent real hypersurfaces in complex two-plane Grassmannians can also be proved.

Let R be any subring of the reals. We present a generalization of linear systems on graphs where divisors are R-valued functions on the set of vertices and graph edges are permitted to have nonegative weights in R. Using this…

In the study of full bubble model graphs of bounded clique-width and bounded linear clique-width, we determined complete sets of forbidden induced subgraphs, that are minimal in the class of full bubble model graphs. In this note, we show…

We consider drawings of graphs in the plane in which edges are represented by polygonal paths with at most one bend and the number of different slopes used by all segments of these paths is small. We prove that…

We prove that the class of 3D-grids is cannot be transduced from planar graphs, and more generally, from any class of graphs of bounded Euler genus. To prove our result, we introduce a new structural tool called slice decompositions, and…

Wang and Lih in 2002 conjectured that every planar graph without adjacent triangles is 4-choosable. In this paper, we prove that every planar graph without any 4-cycle adjacent to two triangles is DP-4-colorable, which improves the results…

We utilise the two principles of decoupling introduced in arXiv:2407.16108 to prove the following conditional result: assuming uniform decoupling for graphs of polynomials in all dimensions with identically zero Gaussian curvature, we can…

We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.

Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either infinitely many twins or none.

Graph Neural Networks (GNNs) are learning models aimed at processing graphs and signals on graphs. The most popular and successful GNNs are based on message passing schemes. Such schemes inherently have limited expressive power when it…

Deciding whether a planar graph (even of maximum degree $4$) is $3$-colorable is NP-complete. Determining subclasses of planar graphs being $3$-colorable has a long history, but since Gr\"{o}tzsch's result that triangle-free planar graphs…

A \emph{$k$--bisection} of a bridgeless cubic graph $G$ is a $2$--colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes have order…

We prove that there are no Shimura curves $X_0^D(N)$ of squarefree level and of genus at least two admitting a smooth plane model.

Congruences on a graph inverse semigroup were recently described in terms of the underline graph. Based on such descriptions, we show that the lattice of congruences on a graph inverse semigroup is upper semimodular but not lower…

We prove the non-existence of elliptic curves having good reduction everywhere over some real quadratic fields.

In this article, we study model structures on the category of finite graphs with $\times$-homotopy equivalences as the weak equivalences. We show that there does not exist an analogue of Str\o{}m-Hurewicz model structure on this category of…