Related papers: On Vietoris--Rips complexes of hypercube graphs

We give a combinatorial description of general homotopy groups of $k$-dimensional spheres with $k\geq3$ as well as those of Moore spaces. For $n>k\geq 3,$ we construct a finitely generated group defined by explicit generators and relations,…

Partial cubes are graphs that can be isometrically embedded into hypercubes. Convex cycles play an important role in the study of partial cubes. In this paper, we prove that a regular partial cube is a hypercube (resp., a Doubled Odd graph,…

This article introduces the theory of Veronese polytopes, a broad generalisation of cyclic polytopes. These arise as convex hulls of points on curves with one or more connected components, obtained as the image of the rational normal curve…

We study the total cut complexes and their Alexander duals. The homotopy type of these complexes is calculated for de $p$th power of a cycle with at least $2rn$ vertices where $p\leq r$, solving part of a conjecture of Bayer, Denker,…

Let G be a simple connected graph having vertex set V and edge set E. The vertex-set and edge-set of G denoted by V(G) and E(G), respectively. The length of the smallest path between two vertices is called the distance. Mathematical…

Entangled embedded periodic nets and crystal frameworks are defined, along with their dimension type, homogeneity type, adjacency depth and periodic isotopy type. We obtain periodic isotopy classifications for various families of embedded…

Continuing the investigations of Harborth (1974) and the author (2002) we study the following two rather basic problems on sphere packings. Recall that the contact graph of an arbitrary finite packing of unit balls (i.e., of an arbitrary…

The long computational time and large memory requirements for computing Vietoris Rips persistent homology from point clouds remains a significant deterrent to its application to big data. This paper aims to reduce the memory footprint of…

We provide lower bounds on the connectivity of the independence complexes of hypergraphs. Additionally, we compute the homotopy types of the independence complexes of $d$-uniform properly-connected triangulated hypergraphs.

Given a graph $G$ one can define the cut polytope CUTP(G) and the metric polytope METP(G) of this graph and those polytopes encode in a nice way the metric on the graph. According to Seymour's theorem, CUTP(G) = METP(G) if and only if K_5…

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

A Hamilton decomposition of a graph is a partitioning of its edge set into disjoint spanning cycles. The existence of such decompositions is known for all hypercubes of even dimension $2n$. We give a decomposition for the case $n = 2^a3^b$…

We establish a loop space decomposition for certain $CW$-complexes with a single top cell in the presence of a spherical pair, thereby generalizing several known decompositions of Poincar\'{e} duality complexes in which a loop of a product…

We study mapping class group orbits of homotopy and isotopy classes of curves with self-intersections. We exhibit the asymptotics of the number of such orbits of curves with a bounded number of self-intersections, as the complexity of the…

Let $X_1,..., X_n$ be independent, uniformly random points from $[0,1]^2$. We prove that if we add edges between these points one by one by order of increasing edge length then, with probability tending to 1 as the number of points $n$…

We discuss approximations of the vertex coupling on a star-shaped quantum graph of $n$ edges in the singular case when the wave functions are not continuous at the vertex and no edge-permutation symmetry is present. It is shown that the…

The cube graph Q_n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2^n vertices. The Ramsey number r(Q_n, K_s) is the minimum N such that every graph of order N contains the cube graph Q_n or an independent set of…

For an integer $n\geq 2$, the triangular graph has vertex set the $2$-subsets of $\{1,\ldots,n\}$ and edge set the pairs of $2$-subsets intersecting at one point. Such graphs are known to be halved graphs of bipartite rectagraphs, which are…

We show that every $3$-uniform hypergraph $H=(V,E)$ with $|V(H)|=n$ and minimum pair degree at least $(4/5+o(1))n$ contains a squared Hamiltonian cycle. This may be regarded as a first step towards a hypergraph version of the P\'osa-Seymour…

We introduce WI-posets as intermediate objects in the study of Z_2-homotopy types of graph complexes. It turns out that (almost) all graph complexes associated to a graph can be viewed as avatars of the same object, as long as their…