Related papers: Finiteness of mapping degrees and ${\rm PSL}(2,{\R…

The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible value (the Moore bound) are extremely rare, but much activity…

Assume that there exists a smooth map between two closed manifolds $M^m\to N^k$ with only finitely many cone-like singular points, where $2\leq k\leq m\leq 2k-1$. If $(m,k)\not\in\{(2,2), (4,3), (5,3), (8,5), (16,9)\}$, then $M^m$ admits a…

Let $G$ be a finite simple non-complete connected graph on $\{1, \ldots, n\}$ and $\kappa(G) \geq 1$ its vertex connectivity. Let $f(G)$ denote the number of free vertices of $G$ and $\mathrm{diam}(G)$ the diameter of $G$. Being motivated…

We complete the classification (started by Bray and the second author) of all closed 3-manifolds with Yamabe invariant greater than that of $\RP^3$, by showing that such manifolds are either $S^3$ or finite connected sums $# m(S^2 \times…

Given $a,b,c\in\mathbb N$, let $D_{a,b,c}$ be the tournament on $a+b+c$ vertices obtained by replacing the vertices of the directed triangle $C_3$ with transitive tournaments $TT_a$, $TT_b$, and $TT_c$, respectively. Keevash and Sudakov…

In graph theory, as well as in 3-manifold topology, there exist several width-type parameters to describe how "simple" or "thin" a given graph or 3-manifold is. These parameters, such as pathwidth or treewidth for graphs, or the concept of…

This note gives a detailed proof of the following statement. Let $d\in \mathbb{N}$ and $m,n \ge d + 1$, with $m + n \ge \binom{d+2}{2} + 1$. Then the complete bipartite graph $K_{m,n}$ is generically globally rigid in dimension $d$.

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

Graphons are analytic objects associated with convergent sequences of dense graphs. Finitely forcible graphons, i.e., those determined by finitely many subgraph densities, are of particular interest because of their relation to various…

Let $N(d,n)$ be the variety of all $d$-tuples of commuting nilpotent $n\times n$ matrices. It is well-known that $N(d,n)$ is irreducible if $d=2$, if $n\le 3$ or if $d=3$ and $n=4$. On the other hand $N(3,n)$ is known to be reducible for…

A nut graph is a simple graph for which the adjacency matrix has a single zero eigenvalue such that all non-zero kernel eigenvectors have no zero entry. It is known that infinitely many $d$-regular nut graphs exist for $3 \leq d \leq 12$…

The structure of the character degree graphs $\Delta(G)$, i.e. the prime graphs on the set $\mathrm{cd}(G)$ of the irreducible character degrees of a finite group $G$, such that $G$ is solvable and $\Delta(G)$ has diameter three, remains an…

We show that if a closed oriented $n$-manifold $M$ has a non-trivial cohomology class of even degree $k$, whose all pullbacks to products of type $S^1\times N$ vanish, then the topological complexity $\mathrm{TC}(M)$ is at least $6$, if $n$…

Let M be any closed, locally symmetric n-manifold (n>1) of nonpositive curvature. Assume that M has no locally Euclidean factors and no factors locally isometric to SL(3,R). Then for any closed Riemannian manifold N and any continuous map…

We use model theory to study relative profinite rigidity of $3$-manifold groups and show that given any residually finite group $\Gamma$ with finite character variety and single-cusped finite volume hyperbolic $3$-manifold $M$, cofinitely…

Let N_{g,s} denote the nonorientable surface of genus g with s boundary components. Recently Paris and Szepietowski obtained an explicit finite presentation for the mapping class group M(N_{g,s}) of the surface N_{g,s}, where s\in{0,1} and…

We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…

We continue our study of ends non-compact manifolds. The over-arching aim is to provide an appropriate generalization of Siebenmann's famous collaring theorem that applies to manifolds having non-stable fundamental group systems at…

We present an extremal result for the class of graphs G which (together with some specified sets of input and output vertices, I and O) have a certain "flow" property introduced by Danos and Kashefi for the one-way measurement model of…

In 2018, Dankelmann, Gao, and Surmacs [J. Graph Theory, 88(1): 5--17, 2018] established sharp bounds on the oriented diameter of a bridgeless undirected graph and a bridgeless undirected bipartite graph in terms of vertex degree. In this…