Related papers: Complexes of graphs with bounded matching size
Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…
We generalize the notion of graph minors to all (finite) simplicial complexes. For every two simplicial complexes H and K and every nonnegative integer m, we prove that if H is a minor of K then the non vanishing of Van Kampen's obstruction…
We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…
We show that the discretized configuration space of $k$ points in the $n$-simplex is homotopy equivalent to a wedge of spheres of dimension $n-k+1$. This space is homeomorphic to the order complex of the poset of ordered partial partitions…
For $r\geq 1$, the $r$-independence complex of a graph $G$, denoted Ind$_r(G)$, is a simplicial complex whose faces are subsets $A \subseteq V(G)$ such that each component of the induced subgraph $G[A]$ has at most $r$ vertices. In this…
The Graph Minors Structure Theorem of Robertson and Seymour asserts that, for every graph $H,$ every $H$-minor-free graph can be obtained by clique-sums of ``almost embeddable'' graphs. Here a graph is ``almost embeddable'' if it can be…
Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards detection of higher…
The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…
For all integers $k$ with $k\geq 2$, if $G$ is a balanced $k$-partite graph on $n\geq 3$ vertices with minimum degree at least \[…
A vertex set $U \subseteq V$ of an undirected graph $G=(V,E)$ is a $\textit{resolving set}$ for $G$, if for every two distinct vertices $u,v \in V$ there is a vertex $w \in U$ such that the distances between $u$ and $w$ and the distance…
We show that discrete and classical homotopy theories are equivalent after localizing at n-equivalences for any non-negative integer n. By constructing an explicit homotopy inverse to the graph nerve functor associating an n-fibrant cubical…
Inspired by a concept in comparative genomics, we investigate properties of randomly chosen members of G_1(m,n,t), the set of bipartite graphs with $m$ left vertices, n right vertices, t edges, and each vertex of degree at least one. We…
We denote the matching complex of the complete graph with $n$ vertices by $M_n$. Bouc first studied the topological properties of $M_n$ in connection with the Quillen complex. Later Bj\"{o}rner, Lov\'{a}sz, Vre\'{c}ica, and…
Our goal is to investigate a close relative of the independent transversal problem in the class of infinite $K_n$-free graphs: we show that for any infinite $K_n$-free graph $G=(V,E)$ and $m\in \mathbb N$ there is a minimal $r=r(G,m)$ such…
The topology of the matching complex for the $2\times n$ grid graph is mysterious. We describe a discrete Morse matching for a family of independence complexes $\mathrm{Ind}(\Delta_n^m)$ that include these matching complexes. Using this…
For any positive integer $n$, the author previously constructed several minimal simplicial $n$-complexes which necessarily contain a non-splittable two-component link, consisting of an $(n-1)$-sphere and an $n$-sphere, in any embedding into…
A $(G,n)$-complex is an $n$-dimensional CW-complex with fundamental group $G$ and whose universal cover is $(n-1)$-connected. If $G$ has periodic cohomology then, for appropriate $n$, we show that there is a one-to-one correspondence…
A clique covering of a graph $G$ is a set of cliques of $G$ such that any edge of $G$ is contained in one of these cliques, and the weight of a clique covering is the sum of the sizes of the cliques in it. The sigma clique cover number…
A periodic cell complex, $K$, has a finite representation as the quotient space, $q(K)$, consisting of equivalence classes of cells identified under the translation group acting on $K$. We study how the Betti numbers and cycles of $K$ are…
In this paper we consider module-composed graphs, i.e. graphs which can be defined by a sequence of one-vertex insertions v_1,...,v_n, such that the neighbourhood of vertex v_i, 2<= i<= n, forms a module (a homogeneous set) of the graph…