Related papers: Forbidden Four Cycle, Star Graphs and Isometric Em…
Four algorithms giving rise to graceful graphs from a known (non)graceful graph are described. Some necessary conditions for a graph to be highly graceful and critical are given. Finally some conjectures are made on graceful, critical and…
The spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Let $\mathcal{F}(\lambda)$ be the family of connected graphs of spectral radius $\le \lambda$. We show that $\mathcal{F}(\lambda)$ can be defined by a finite…
We introduce an obstruction to the existence of a coarse embedding of a given group or space into a hyperbolic group, or more generally into a hyperbolic graph of bounded degree. The condition we consider is "admitting exponentially many…
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…
Let $(M,d)$ be a bounded countable metric space and $c>0$ a constant, such that $d(x,y)+d(y,z)-d(x,z) \ge c$, for any pairwise distinct points $x,y,z$ of $M$. For such metric spaces we prove that they can be isometrically embedded into any…
Let $E$ be a countable directed graph. We show that $C^*(E)$ is AF-embeddable if and only if no loop in $E$ has an entrance. The proof is constructive and is in the same spirit as the Drinen-Tomforde desingularization.
A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of minimal forbidden induced subgraphs. In spite of quite active…
We show that any metric on $S^2$ with Gauss curvature $K \geq -\kappa$ admits a $C^{1,1}$-isometric embedding into the hyperbolic space with sectional curvature $-\kappa$. We also give a sufficient condition for a metric on $S^2$ to be…
We consider the numbers of positive and negative eigenvalues of matrices of squared distances between randomly sampled i.i.d. points in a given metric measure space. These numbers and their limits, as the number of points grows, in fact…
In this note, we introduce and study position space Feynman quadrics that are the loci of divergences of the position space Feynman integrals for Euclidean massless scalar quantum field theories. We prove that the Feynman quadrics define…
We consider realizations of a graph in the plane such that the distances between adjacent vertices satisfy the constraints given by an edge labeling. If there are infinitely many such realizations, counted modulo rigid motions, the labeling…
The intersection graphs of stars in some tree are known as substar graphs. In this paper we give a characterization of substar graphs by the list of minimal forbidden induced subgraphs. This corrects a flaw in the main result of Chang,…
We show that c-planarity is solvable in quadratic time for flat clustered graphs with three clusters if the combinatorial embedding of the underlying graph is fixed. In simpler graph-theoretical terms our result can be viewed as follows.…
Let $G$ be a relatively hyperbolic group that admits a decomposition into a finite graph of relatively hyperbolic groups structure with quasi-isometrically (qi) embedded condition. We prove that the set of conjugates of all the vertex and…
A graph $H$ is an induced subgraph of a graph $G$ if a graph isomorphic to $H$ can be obtained from $G$ by deleting vertices. Recently, there has been significant interest in understanding the unavoidable induced subgraphs for graphs of…
We conclude an investigation of Abrishami, Esperet, Giocanti, Hamman, Knappe and M\"oller studying the existence of periodic colourings of locally finite graphs. A colouring of a graph $\Gamma$ is periodic if the resulting coloured graph…
We define metric bundles/metric graph bundles which provide a purely topological/coarse-geometric generalization of the notion of trees of metric spaces a la Bestvina-Feighn in the special case that the inclusions of the edge spaces into…
In descending generality I survey: five partial orderings of graphs, the induced-subgraph ordering, and examples like perfect, threshold, and mock threshold graphs. The emphasis is on how the induced subgraph ordering differs from other…
We extend the results of B. Minemyer by showing that any indefinite metric polyhedron (either compact or not) with the vertex degree bounded from above admits an isometric simplicial embedding into a Minkowski space of the lowest possible…
When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in…