Related papers: Complexes of Directed Trees and Independence Compl…
In this paper we construct a Universal chain complex, counting zeros of closed 1-forms on a manifold. The Universal complex is a refinement of the well known Novikov complex; it relates the homotopy type of the manifold, after a suitable…
We show that if a graph $G$ involves a certain square grid graph as a full subgraph, then a certain operation on it yields a simplicial suspension of the independence complex of $G$. This generalizes a result of Csorba. As a corollary, we…
We study the first-order almost-sure theories for classes of finite structures that are specified by homomorphically forbidding a set $\mathcal{F}$ of finite structures. If $\mathcal{F}$ consists of undirected graphs, a full description of…
Directed graphs are ubiquitous models for networks, and topological spaces they generate, such as the directed flag complex, have become useful objects in applied topology. The simplices are formed from directed cliques. We extend Atkin's…
We deduce from a theorem of Dvorak--Norin that the separation and treewidth profiles of graphs are asymptotically equivalent, resolving a question of Huang--Hume--Kelly--Lam. As an application, we calculate the separation profiles of Cayley…
Let $r$ be a positive integer. An $r$-set is a pair $X= (V(X),R(X))$ consisting of a set $V(X)$ with a subset $R(X)$ of the direct product $V(X)^r$. The object of this paper is to investigate the Hom complexes of $r$-sets, which were…
Motivated by a question of Galby, Munaro, and Yang (SoCG 2023) asking whether every graph class of bounded layered tree-independence number admits clique-based separators of sublinear weight, we investigate relations between layered…
Directed graphs have long been used to gain understanding of the structure of semigroups, and recently the structure of directed graph semigroups has been investigated resulting in a characterization theorem and an analog of Fruct's…
We introduce a new graph polynomial that encodes interesting properties of graphs, for example, the number of matchings and the number of perfect matchings. Most importantly, for bipartite graphs the polynomial encodes the number of…
Poisson brackets admit infinitesimal symmetries which are encoded using oriented graphs; this construction is due to Kontsevich (1996). We formulate several open problems about combinatorial and topological properties of the graphs…
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.
In this paper, we investigate normal trees of directed graphs, which extend the fundamental concept of normal trees of undirected graphs. We prove that a directed graph $D$ has a normal spanning tree if and only if the topological space…
We construct a functor associating a cubical set to a (simple) graph. We show that cubical sets arising in this way are Kan complexes, and that the A-groups of a graph coincide with the homotopy groups of the associated Kan complex. We use…
Associated to a simple undirected graph G is a simplicial complex whose faces correspond to the independent sets of G. We call a graph G shellable if this simplicial complex is a shellable simplicial complex in the non-pure sense of…
We show that graphs generated by collapsible pushdown systems of level 2 are tree-automatic. Even if we allow epsilon-contractions and reachability predicates (with regular constraints) for pairs of configurations, the structures remain…
We construct branched double coverings by certain direct products of manifolds for connected sums of copies of sphere bundles over the 2-sphere. As an application we answer a question of Kotschick and Loeh up to dimension five. More…
We discuss controlled connectivity properties of closed 1-forms and their cohomology classes and relate them to the simple homotopy type of the Novikov complex. The degree of controlled connectivity of a closed 1-form depends only on…
Distance well-defined graphs consist of connected undirected graphs, strongly connected directed graphs and strongly connected mixed graphs. Let $G$ be a distance well-defined graph, and let ${\sf D}(G)$ be the distance matrix of $G$.…
We prove a conjecture of Fox, Huang, and Lee that characterizes directed graphs that have constant density in all tournaments: they are disjoint unions of trees that are each constructed in a certain recursive way.
The degree-Rips bifiltration is the most computable of the parameter-free, density-sensitive bifiltrations in topological data analysis. It is known that this construction is stable to small perturbations of the input data, but its…