Related papers: Transitivity is not a (big) restriction on homotop…
A graph or hypergraph is said to be vertex-transitive if its automorphism group acts transitively upon its vertices. A classic theorem of Mader asserts that every connected vertex-transitive graph is maximally edge-connected. We generalise…
We introduce uniformly vertex-transitive graphs as vertex-transitive graphs satisfying a stronger condition on their automorphism groups, motivated by a problem which arises from a Sinkhorn-type algorithm. We use the derangement graph…
We initiate the study of Hamiltonian cycles up to symmetries of the underlying graph. Our focus lies on the extremal case of Hamiltonian-transitive graphs, i.e., Hamiltonian graphs where, for every pair of Hamiltonian cycles, there is a…
The aim of this paper is to give a (discrete) Morse theoretic proof of the fact that the $k$-th skeleton of the flag complex $\mathcal{F}$, associated to the lattice of subspaces of a finite dimensional vector space, is homotopy equivalent…
The complement of the codimension 2 complex coordinate subspace arrangement is shown to be homotopy equivalent to a wedge of spheres.
If $K$ is a simplicial complex on $m$ vertices the flagification of $K$ is the minimal flag complex $K^f$ on the same vertex set that contains $K$. Letting $L$ be the set of vertices, there is a sequence of simplicial inclusions $L\to K\to…
A map $f:X\to Y$ to a simplicial complex $Y$ is called a $Y$-triangular homotopy equivalence if it has a homotopy inverse $g$ and homotopies $h_1:f\circ g\simeq \mathrm{id}_Y$, $h_2:g\circ f\simeq \mathrm{id}_X$ such that for all simplices…
The Surjective Homomorphism problem is to test whether a given graph G called the guest graph allows a vertex-surjective homomorphism to some other given graph H called the host graph. The bijective and injective homomorphism problems can…
The operation of switching a graph $\Gamma$ with respect to a subset $X$ of the vertex set interchanges edges and non-edges between $X$ and its complement, leaving the rest of the graph unchanged. This is an equivalence relation on the set…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…
We show that the independence complex of a chordal graph is contractible if and only if this complex is dismantlable (strong collapsible) and it is homotopy equivalent to a sphere if and only if its core is a cross-polytopal sphere. The…
It has been shown that there is a Hamilton cycle in every connected Cayley graph on each group G whose commutator subgroup is cyclic of prime-power order. This paper considers connected, vertex-transitive graphs X of order at least 3 where…
The dual complex of a singularity is defined, up-to homotopy, using resolutions of singularities. In many cases, for instance for isolated singularities, we identify and study a "minimal" representative of the homotopy class that is well…
We investigate the homotopy type of the Alexander dual of a simplicial complex. In general the homotopy type of K does not determine the homotopy type of its dual K*. Moreover, one can construct for each finitely presented group G, a simply…
For each positive integer $n$, let $G_n$ be the graph whose vertices are the partitions of $n$, with edges corresponding to elementary transfers of one cell between two parts, followed by reordering. Let $K_n := \mathrm{Cl}(G_n)$ be the…
A graph is edge-transitive if the natural action of its automorphism group on its edge set is transitive. An automorphism of a graph is semiregular if all of the orbits of the subgroup generated by this automorphism have the same length.…
The (k,d)-hypersimplex is a (d-1)-dimensional polytope whose vertices are the (0,1)-vectors that sum to k. When k=1, we get a simplex whose graph is the complete graph with d vertices. Here we show how many of the well known graph…
We prove that strongly homotopy algebras (such as $A_\infty$, $C_\infty$, sh Lie, $B_\infty$, $G_\infty$,...) are homotopically invariant in the category of chain complexes. An important consequence is a rigorous proof that `strongly…
We prove that every vertex transitive, planar, 1-ended, graph covers every graph whose balls of radius r are isomorphic to the ball of radius r in G for a sufficiently large r. We ask whether this is a general property of finitely presented…
We introduce the van der Waerden complex ${\rm vdW}(n,k)$ defined as the simplicial complex whose facets correspond to arithmetic progressions of length $k$ in the vertex set $\{1, 2, \ldots, n\}$. We show the van der Waerden complex ${\rm…