Related papers: Knotted Spheres and Graphs in Balls
An embedding of a graph on a translation surface is said to be \emph{systolic} if each vertex of the graph corresponds to a singular point (or marked point) and each edge corresponds to a shortest saddle connection on the translation…
In this note we provide natural optimal geometric conditions for a Riemannian manifold suitably covered by two open metric balls to be homeomorphic to a sphere. This can be viewed as a geometric analogue of Brown's theorem in topology…
We consider a partially overdetermined problem in a sector-like domain $\Omega$ in a cone $\Sigma$ in $\mathbb{R}^N$, $N\geq 2$, and prove a rigidity result of Serrin type by showing that the existence of a solution implies that $\Omega$ is…
We show that for a sufficiently simple surface $S$, a right-angled Artin group $A(\Gamma)$ embeds into $\Mod(S)$ if and only if $\Gamma$ embeds into the curve graph $\mC(S)$ as an induced subgraph. When $S$ is sufficiently complicated,…
In this paper, we study different forbidden subgraph characterizations of the prime-order element graph $\Gamma(G)$ defined on a finite group $G$. Its set of vertices is the group $G$ and two vertices $x,y \in G$ are adjacent if the order…
The dichotomy conjecture for the parameterized embedding problem states that the problem of deciding whether a given graph $G$ from some class $K$ of "pattern graphs" can be embedded into a given graph $H$ (that is, is isomorphic to a…
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…
For a graph whose vertex set is a finite set of points in the Euclidean $d$-space consider the closed (open) balls with diameters induced by its edges. The graph is called a (an open) Tverberg graph if these closed (open) balls intersect.…
We study the transmission of a quantum particle along a straight input--output line to which a graph $\Gamma$ is attached at a point. In the point of contact we impose a singularity represented by a certain properly chosen scale-invariant…
For a locally finite, connected graph $\Gamma$, let $\operatorname{Map}(\Gamma)$ denote the group of proper homotopy equivalences of $\Gamma$ up to proper homotopy. Excluding sporadic cases, we show $\operatorname{Aut}(S(M_\Gamma)) \cong…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
We prove that the only embedded free boundary minimal surface $\Sigma$ in $\mathbb{B}^3$ with index $4$ is the critical catenoid. This extends fundamental work of A. Fraser and R. Schoen, as well as the work of H. Tran.
We give sufficient conditions under which a random graph with a specified degree sequence is symmetric or asymmetric. In the case of bounded degree sequences, our characterisation captures the phase transition of the symmetry of the random…
Consider the family of graphs without $ k $ node-disjoint odd cycles, where $ k $ is a constant. Determining the complexity of the stable set problem for such graphs $ G $ is a long-standing problem. We give a polynomial-time algorithm for…
In [20], Ros and Vergasta proved that an immersed orientable compact stable constant mean curvature surface $\Sigma$ with free boundary in a closed ball $B\subset\mathbb{R}^3$ must be a planar equator, a spherical cap or a surface of genus…
We present some enumerative and structural results for flag homology spheres. For a flag homology sphere $\Delta$, we show that its $\gamma$-vector $\gamma^\Delta=(1,\gamma_1,\gamma_2,\ldots)$ satisfies: \begin{align*} \gamma_j=0,\text{ for…
Let $\Gamma$ be a graph with diameter at least two. Then $\Gamma$ is said to be $1$-homogeneous (in the sense of Nomura) whenever for every pair of adjacent vertices $x$ and $y$ in $\Gamma$, the distance partition of the vertex set of…
An \emph{s-graph} is a graph with two kinds of edges: \emph{subdivisible} edges and \emph{real} edges. A \emph{realisation} of an s-graph $B$ is any graph obtained by subdividing subdivisible edges of $B$ into paths of arbitrary length (at…
Boundary conditions in quantum graph vertices are generally given in terms of a unitary matrix $U$. Observing that if $U$ has at most two eigenvalues, then the scattering matrix $\mathcal{S}(k)$ of the vertex is a linear combination of the…
In this study we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This give an alternative characterization of triangulated graphs. Our method is based on…