Related papers: The real equiangular tight frames obtained from ra…
Let $M$ be a closed, orientable hyperbolic 3-manifold and $\phi$ a homomorphism of its fundamental group onto $\mathbb{Z}$ that is not induced by a fibration over the circle. For each natural number $n$ we give an explicit lower bound,…
A graph is called equimatchable if all of its maximal matchings have the same size. Frendrup et al. [8] provided a characterization of equimatchable graphs with girth at least $5$. In this paper, we extend this result by providing a…
We characterise the quintic (i.e. 5-regular) multigraphs with the property that every edge lies in a triangle. Such a graph is either from a set of small graphs or is formed by adding a perfect matching to a line graph of a cubic graph as…
We prove that every connected strongly regular graph on sufficiently many vertices is Hamiltonian. We prove this by showing that, apart from three families, connected strongly regular graphs are (highly) pseudo-random. Our results suggest a…
In this paper, we study stable weighted minimal hypersurfaces in manifolds with nonnegative Bakry-Emery Ricci curvature. We will give some geometric and topological applications. In particular, we give some partial classification of…
We show that many 3-manifold groups have no nonabelian surface subgroups. For example, any link of an isolated complex surface singularity has this property. In fact, we determine the exact class of closed graph-manifolds which have no…
We prove that for every closed, connected, orientable, irreducible 3-manifold, there exists an alternating group A_n which is not the topological symmetry group of any graph embedded in the manifold. We also show that for every finite group…
Classes of branched surfaces extend the classes of surfaces or 2-dimensional manifolds satisfying suitable properties and defined in various manners. Reeb spaces of smooth maps of suitable classes into surfaces whose codimensions are…
Two groups are virtually isomorphic if they can be obtained one from the other via a finite number of steps, where each step consists in taking a finite extension or a finite index subgroup (or viceversa). Virtually isomorphic groups are…
When the number of non-triangular faces adjacent to a vertex $v$ is less than or equal to three, the vertex $v$ will be called (\emph{combinatorially}) \emph{rigid}. We study the number of rigid vertices and suggest a conjecture on a…
We will present a relation between real equiangular frames and certain special sets in groups which we call signature sets and show that many equiangular frames arise in this manner. Then we will define quasi-signature sets and will examine…
\emph{A root frame} for $\mathbb{R}^d$ is a finite frame whose vectors form a root system. In this note we establish some elementary properties of this class of frames and prove that root frames constitute a subclass of scalable frames. In…
This thesis focuses on theoretical and algorithmic tools for determining the numbers of induced subgraphs in strongly regular graphs, SRGs, and on further applications of such numbers. We consider in more detail a restricted class of these…
We define formal exponential maps for any graded manifold as maps from the formal tangent bundle (that we also define) into the graded manifold. We show that each such map uniquely determines and is determined by its associated Grothendieck…
We calculate the intersection ring of three-dimensional graph manifolds with rational coefficients and give an algebraic characterization of these rings when the manifold's underlying graph is a tree. We are able to use this…
A graph whose edges only appear at certain points in time is called a temporal graph (among other names). Such a graph is temporally connected if each ordered pair of vertices is connected by a path which traverses edges in chronological…
We classify nets of quadrics in P^3 which give rise to elliptic fibrations of Mordell-Weil rank zero.
We characterise rigid graphs for cylindrical normed spaces $Z=X\oplus_\infty \mathbb{R}$ where $X$ is a finite dimensional real normed linear space and $Z$ is endowed with the product norm. In particular, we obtain purely combinatorial…
Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…
In this note, we investigate fundamental relations between exploration processes in random graphs, and branching processes. We formulate a class of models that we call {\em rank-$k$ random graphs}, and that are special in that their…