Related papers: Forbidden Four Cycle, Star Graphs and Isometric Em…

For arbitrary star graph $S$ with a non-degenerate vertex labeling $l\colon V(S) \to \mathbb{R}^+$ we denote by $d_l$ the corresponding ultrametric on the vertex set $V(S)$ of $S$. We characterize the class $\bf US$ of all ultrametric…

Let US be the class of all ultrametric spaces generated by labeled star graphs. We prove that compact US-spaces are the completions of totally bounded ultrametric spaces generated by decreasingly labeled rays. We characterize the…

Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…

We describe the class of graphs for which all metric spaces with diametrical graphs belonging to this class are ultrametric. It is shown that a metric space $(X, d)$ is ultrametric iff the diametrical graph of the metric $d_{\varepsilon}(x,…

We give a necessary and sufficient condition for the mapping class group of the pair of the 3-sphere and a graph embedded in it to be isomorphic to the topological symmetry group of the embedded graph.

We consider the problem of determining the inducibility (maximum possible asymptotic density of induced copies) of oriented graphs on four vertices. We provide exact values for more than half of the graphs, and very close lower and upper…

We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…

A metric space is indivisible if for any partition of it into finitely many pieces one piece contains an isometric copy of the whole space. Continuing our investigation of indivisible metric spaces, we show that a countable ultrametric…

For a finite lattice $\Lambda$, $\Lambda$-ultrametric spaces have, among other reasons, appeared as a means of constructing structures with lattices of equivalence relations embedding $\Lambda$. This makes use of an isomorphism of…

We consider the Grassmann graphs and dual polar graphs over the same finite field and show that, up to graph automorphism, for every dual polar graph there is the unique isometric embedding in the corresponding Grassmann graph.

We prove an upper bound for the number of edges a C4-free graph on q^2 + q vertices can contain for q even. This upper bound is achieved whenever there is an orthogonal polarity graph of a plane of even order q.

In a recent paper by a superset of the authors it was proved that for every primitive 3-constrained space $\Gamma$ of finite diameter $\delta$ from Cherlin's catalogue of metrically homogeneous graphs, there exists a finite family $\mathcal…

In this paper we will establish necessary and sufficient conditions for a Laplace-Carleson embedding to be bounded for certain spaces of functions on the positive half-line. We will use these results to characterise weighted (infinite-time)…

We define inductively isometric embeddings of $\mb{P}^n(\mb{R})$ and $\mb{P}^n(\mb{C})$ (with their canonical metrics conveniently scaled) into the standard unit sphere, which present the former as the restriction of the latter to the set…

We give sufficient conditions for a metric space to bilipschitz embed in L_1. In particular, if X is a length space and there is a Lipschitz map u:X--->R such that for every interval I in R, the connected components of the inverse image…

We prove properties of extremal graphs of girth 5 and order 20 <=v <= 32. In each case we identify the possible minimum and maximum degrees, and in some cases prove the existence of (non-trivial) embedded stars. These proofs allow for…

In [The Space of Spaces: Curvature Bounds and Gradient Flows on the Space of Metric Measure Spaces. Memoirs of the American Mathematical Society. American Mathematical Society, 2023], Sturm studied the space of all metric measure spaces up…

If a class of finitely generated groups Curly(G) is closed under isometric amalgamations along free subgroups, then every G in Curly(G) can be quasi-isometrically embedded in a group Hat(G) in Curly(G) that has no proper subgroups of finite…

Here in particular, we give a characterization of Quasi-line Graphs in terms of forbidden induced subgraphs. In general, we prove a necessary and sufficient condition for a graph to be a union of two cliques.

We show that if G is a 4-critical graph embedded in a fixed surface $\Sigma$ so that every contractible cycle has length at least 5, then G can be expressed as $G=G'\cup G_1\cup G_2\cup ... \cup G_k$, where $|V(G')|$ and $k$ are bounded by…