Related papers: Nonplanar graphs in boundaries of CAT(0) groups
The singular cubical homology theory for the category of quivers or digraphs can be constructed similarly to the classical singular homology theory for topological spaces. The case of digraphs and quivers differs from the topological case…
Oriented graph complexes, in which graphs are not allowed to have oriented cycles, govern for example the quantization of Lie bialgebras and infinite dimensional deformation quantization. It is shown that the oriented graph complex GC^or_n…
We study locally flat, compact, oriented surfaces in $4$-manifolds whose exteriors have infinite cyclic fundamental group. We give algebraic topological criteria for two such surfaces, with the same genus $g$, to be related by an ambient…
We study cospectral vertices on finite graphs in relation to the echolocation problem on Riemannian manifolds. First, We prove a computationally simple criterion to determine whether two vertices are cospectral. Then, we use this criterion…
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…
From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…
We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of M\"oller in \cite{moeller92ends2} for locally finite and transitive graphs are generalized. We also give a criterion which…
A graph is \emph{fan-crossing free} if it has a drawing in the plane so that each edge is crossed by independent edges, that is the crossing edges have distinct vertices. On the other hand, it is \emph{fan-crossing} if the crossing edges…
We introduce the class of outerspatial 2-complexes as the natural generalisation of the class of outerplanar graphs to three dimensions. Answering a question of O-joung Kwon, we prove that a locally 2-connected 2-complex is outerspatial if…
For every simplicial complex X, we construct a locally CAT(0) cubical complex T_X, a cellular isometric involution i on T_X and a map t_X from T_X to X with the following properties: t_Xi = t_X; t_X is a homology isomorphism; the induced…
In order to apply quantum topology methods to nonplanar graphs, we define a planar diagram category that describes the local topology of embeddings of graphs into surfaces. These \emph{virtual graphs} are a categorical interpretation of…
In a recent paper \cite{T} the fact that a class of locally compact metric spaces $X$, among which are Euclidean spaces, are not homemorphic to their punctured version $X\men\{p\}$, was given an interesting new proof which does not use…
Dujmovi\'c et al. [\emph{J.~ACM}~'20] recently proved that every planar graph is isomorphic to a subgraph of the strong product of a bounded treewidth graph and a path. Analogous results were obtained for graphs of bounded Euler genus or…
We provide conditions on the defining graph of a right-angled Coxeter group presentation that guarantees the boundary of any CAT(0) space on which the group acts geometrically will be locally connected. This is a revised version of a…
We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: "globally noncrossing" graphs, which avoid crossings in all of their configurations; matchstick graphs,…
A $k$-inner planar graph is a planar graph that has a plane drawing with at most $k$ {internal vertices}, i.e., vertices that do not lie on the boundary of the outer face of its drawing. An outerplanar graph is a $0$-inner planar graph. In…
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…
We prove that numerous negatively curved simply connected locally compact polyhedral complexes, admitting a discrete cocompact group of automorphisms, have automorphism groups which are locally compact, uncountable, non linear and virtually…
We show that, under weak assumptions, the automorphism group of a ${\rm CAT(0)}$ cube complex $X$ coincides with the automorphism group of Hagen's contact graph $\mathcal{C}(X)$. The result holds, in particular, for universal covers of…
In two seminal papers Kontsevich used a construction called_graph homology_ as a bridge between certain infinite dimensional Lie algebras and various topological objects, including moduli spaces of curves, the group of outer automorphisms…