Related papers: On 2-complexes embeddable in 4-space, and the excl…

If $G$ has $4$-periodic cohomology, then D2 complexes over $G$ are determined up to polarised homotopy by their Euler characteristic if and only if $G$ has at most two one-dimensional quaternionic representations. We use this to solve…

For any collection of graphs we find the minimal dimension d such that the product of these graphs is embeddable into the d-dimensional Euclidean space. In particular, we prove that the n-th powers of the Kuratowsky graphs are not…

To each complex reflection group $\Gamma$ one can attach a canonical symplectic singularity $\mathcal{M}_\Gamma$ arXiv:math/9903070. Motivated by the 4D/2D duality arXiv:1312.5344, arXiv:1707.07679, Bonetti, Meneghelli and Rastelli…

We prove that if $M$ is a CW-complex and $*$ is a 0-cell of $M$, then the crossed module $\Pi_2(M,M^1,*)$ does not depend on the cellular decomposition of $M$ up to free products with $\Pi_2(D^2,S^1,*)$, where $M^1$ is the 1-skeleton of…

Each finite and connected bipartite graph induces a finite collection of non-isomorphic dessins d'enfants, that is, $2$-cell embeddings of it into some closed orientable surface. We describe an algorithm to compute all these dessins…

Eisenbud Popescu and Walter have constructed certain special 4-dimensional sextic hypersurfaces as Lagrangian degeneracy loci. We prove that the natural double cover of a generic EPW-sextic is a deformation of the Hilbert square of a…

The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings of such graphs, up to rigid motions, in Euclidean space. We capture…

For any two graphs $G$ and $H$ Lov\'asz has defined a cell complex $Hom(G,H)$ having in mind the general program that the algebraic invariants of these complexes should provide obstructions to graph colorings. Here we announce the proof of…

Archdeacon (1987) proved that graphs embeddable on a fixed surface can be $3$-coloured so that each colour class induces a subgraph of bounded maximum degree. Edwards, Kang, Kim, Oum and Seymour (2015) proved that graphs with no…

We derive a generalization of the flat space Yang's and Newman's equations for self-dual Yang-Mills fields to (locally) conformally Kahler Riemannian 4-manifolds. The results also apply to Einstein metrics (whose full curvature is not…

The polynomial invariants $q_d$ for a large class of smooth 4-manifolds are shown to satisfy universal relations. The relations reflect the possible genera of embedded surfaces in the 4-manifold and lead to a structure theorem for the…

The {\em topological symmetry group} of an embedding $\Gamma$ of an abstract graph $\gamma$ in $S^3$ is the group of automorphisms of $\gamma$ which can be realized by homeomorphisms of the pair $(S^3, \Gamma)$. These groups are motivated…

We review the regular tilings of d-sphere, Euclidean d-space, hyperbolic d-space and Coxeter's regular hyperbolic honeycombs (with infinite or star-shaped cells or vertex figures) with respect of possible embedding, isometric up to a scale,…

Closed oriented 4-manifolds with the same geometrically 2-dimensional fundamental group (satisfying certain properties) are classified up to $s$-cobordism by their $w_2$-type, equivariant intersection form and the Kirby-Siebenmann…

We give necessary and sufficient conditions for certain pushouts of topological spaces in the category of Cech's closure spaces to agree with their pushout in the category of topological spaces. We prove that in these two categories, the…

For a fixed set ${\cal H}$ of graphs, a graph $G$ is ${\cal H}$-subgraph-free if $G$ does not contain any $H \in {\cal H}$ as a (not necessarily induced) subgraph. A recently proposed framework gives a complete classification on ${\cal…

It was proved by Huynh, Mohar, \v{S}\'amal, Thomassen and Wood in 2021 that any countable graph containing every countable planar graph as a subgraph has an infinite clique minor. We prove a finite, quantitative version of this result: for…

There is much recent interest in understanding the density at which constant size graphs can appear in a very large graph. Specifically, the inducibility of a graph H is its extremal density, as an induced subgraph of G, where |G| ->…

The $2$-cell embeddings of graphs on closed surfaces have been widely studied. It is well known that ($2$-cell) embedding a given graph $G$ on a closed orientable surface is equivalent to cyclically ordering the edges incident to each…

Bipartite graphs are a fundamental concept in graph theory with diverse applications. A graph is bipartite iff it contains no odd cycles, a characteristic that has many implications in diverse fields ranging from matching problems to the…