Related papers: A characterization of two-dimensional Buchsbaum ma…

Let $T$ be a torus of dimension $n>1$ and $M$ a compact $T-$manifold. $M$ is a GKM manifold if the set of zero dimensional orbits in the orbit space $M/T$ is zero dimensional and the set of one dimensional orbits in $M/T$ is one…

The mixed metric dimension ${\rm mdim}(G)$ of a graph $G$ is the cardinality of a smallest set of vertices that (metrically) resolves each pair of elements from $V(G)\cup E(G)$. We say that $G$ is a max-mdim graph if ${\rm mdim}(G) = n(G)$.…

A connected simple graph is said dual-hamiltonian if its vertex set has a $2$-coloring such that each color class induces a tree. We call such a coloring a hamiltonian coloring. We prove that if $G$ is a graph with a certain type of…

For a graph $G$, the $\gamma$-graph of $G$, $G(\gamma)$, is the graph whose vertices correspond to the minimum dominating sets of $G$, and where two vertices of $G(\gamma)$ are adjacent if and only if their corresponding dominating sets in…

We prove that every finite connected simplicial complex has the homology of the classifying space for some $\mathrm{CAT}(0)$ cubical duality group. More specifically, for any finite simplicial complex $X$, we construct a locally…

Graphs derived from groups are a widely studied class of graphs, motivated by their highly symmetric structure. In particular, G-graphs offer an easy and interesting alternative construction of semi-symmetric graphs. After recalling the…

We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…

Given a graph G, we investigate the question of determining the parity of the number of homomorphisms from G to some other fixed graph H. We conjecture that this problem exhibits a complexity dichotomy, such that all parity graph…

We address the correspondence search problem among multiple graphs with complex properties while considering the matching consistency. We describe each pair of graphs by combining multiple attributes, then jointly match them in a unified…

For a simplicial complex X on {1,2, ..., n} we define enriched homology and cohomology modules. They are graded modules over k[x_1, ..., x_n] whose ranks are equal to the dimensions of the reduced homology and cohomology groups. We…

Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…

Correspondence homomorphisms are both a generalization of standard homomorphisms and a generalization of correspondence colourings. For a fixed target graph $H$, the problem is to decide whether an input graph $G$, with each edge labeled by…

A connected matching in a graph G consists of a set of pairwise disjoint edges whose covered vertices induce a connected subgraph of G. While finding a connected matching of maximum cardinality is a well-solved problem, it is NP-hard to…

Given a compact Riemannian manifold $(M g)$ and Morse function $f:m\to \mathbb{R}$ whose gradient flow satisfies the Morse-Smale condition, (i.e. the stable and unstable manifolds of f intersect transversely) we construct a chain complex…

This paper is concerned with lower bounds for the connectivity of graphs (one-dimensional skeleta) of triangulations of compact manifolds. We introduce a structural invariant b_M for simplicial d-manifolds M taking values in the range 0 <=…

A multipath in a directed graph is a disjoint union of paths. The multipath complex of a directed graph ${\tt G}$ is the simplicial complex whose faces are the multipaths of ${\tt G}$. We compute the Euler characteristic, and associated…

A geometric graph is a simple graph G together with a straight line drawing of G in the plane with the vertices in general position. Two geometric realizations of a simple graph are geo-isomorphic if there is a vertex bijection between them…

A neighborhood homotopy is an equivalence relation on spatial graphs which is generated by crossing changes on the same component and neighborhood equivalence. We give a complete classification of all 2-component spatial graphs up to…

We introduce the notion of complex $G_2$ manifold $M_{\mathbb C}$, and complexification of a $G_2$ manifold $M\subset M_{\mathbb C}$. As an application we show the following: If $(Y,s)$ is a closed oriented $3$-manifold with a $Spin^{c}$…

The $m$-neighbor complex of a graph is the simplicial complex in which faces are sets of vertices with at least $m$ common neighbors. We consider these complexes for Erdos-Renyi random graphs and find that for certain explicit families of…