Related papers: The compression body graph has infinite diameter
We give a sufficient condition on totally disconnected topological graphs such that their associated topological graph algebras are purely infinite.
We determine the diameter of generalized Grassmann graphs and the zero forcing number of some generalized Johnson graphs, generalized Grassmann graphs and the Hamming graphs. Our work extends several previously known results.
We define a statistic on the graph of commutation classes of a permutation of the symmetric group which is used to show that these graphs are equipped with a ranked poset structure, with a minimum and maximum. This characterization also…
A fullerene graph is a cubic bridgeless plane graph with only pentagonal and hexagonal faces. We exhibit an infinite family of fullerene graphs of diameter $\sqrt{4n/3}$, where $n$ is the number of vertices. This disproves a conjecture of…
After Fossas-Parlier, we consider two graphs $\mathcal{G}_{0}(S)$ and $\mathcal{G}_{\infty}(S)$, constructed from multicurves on connected, orientable surfaces of infinite-type. Our first result asserts that $\mathcal{G}_{\infty}(S)$ has…
For a subgroup $H$ of a finite group $G$, the Frobenius graph $\Gamma(G, H)$ records the constituents of the restrictions to $H$ of the irreducible characters of $G$. We investigate when this graph has diameter 3.
The diameter of the spectral pseudometric on the universal cover of the Hamiltonian diffeomorphism group of $\mathrm{Gr}(2,p)$ is shown to be finite whenever $p$ is a prime number. On the other hand, it is shown that the diameter is…
We consider infinite graphs and the associated energy forms. We show that a graph is canonically compactifiable (i.e. all functions of finite energy are bounded) if and only if the underlying set is totally bounded with respect to any…
A self-contained graph is an infinite graph which is isomorphic to one of its proper induced subgraphs. In this paper, these graphs are studied by presenting some examples and defining some of their sub-structures such as removable…
In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. Unlike for undirected graphs, some ends are joined by limit…
In 2020, a paper [arXiv:2010.13443] appeared in the arXiv claiming to prove that a Moore graph of diameter 2 and degree 57 does not exist. (The paper is in Russian; we include a link to a translation of this paper kindly provided to us by…
We introduce torsoids, a canonical structure in matching covered graphs, corresponding to the bricks and braces of the graph. This allows a more fine-grained understanding of the structure of finite and infinite directed graphs with respect…
General bounds are presented for the diameters of orbital graphs of finite affine primitive permutation groups. For example, it is proved that the orbital diameter of a finite affine primitive permutation group with a nontrivial point…
We present a proof, using spectral techniques, that there is no finite measurable coloring of the odd-distance graph.
In 1930, Ramsey proved that every infinite graph contains either an infinite clique or an infinite independent set as an induced subgraph. K\"{o}nig proved that every infinite graph contains either a ray or a vertex of infinite degree. In…
The group $\text{Diff}(\mathcal{M})$ of diffeomorphisms of a closed manifold $\mathcal{M}$ is naturally equipped with various right-invariant Sobolev norms $W^{s,p}$. Recent work showed that for sufficiently weak norms, the geodesic…
We consider the flip-width of geometric graphs, a notion of graph width recently introduced by Toru\'nczyk. We prove that many different types of geometric graphs have unbounded flip-width. These include interval graphs, permutation graphs,…
We give a short, topological proof that all graphs admit tree-decompositions displaying their topological ends.
We prove that a graph has an infinitesimally rigid placement in a non-Euclidean normed plane if and only if it contains a $(2,2)$-tight spanning subgraph. The method uses an inductive construction based on generalised Henneberg moves and…
End-spaces of infinite graphs naturally generalise the Freudenthal boundary and sit at the interface between graph theory, geometric group theory and topology. Our main result is that every end-space can topologically be represented by a…