Related papers: Extending simplicial complexes: Topological and co…
The clique complex of a graph G is a simplicial complex whose simplices are all the cliques of G, and the line graph L(G) of G is a graph whose vertices are the edges of G and the edges of L(G) are incident edges of G. In this article, we…
The interaction between combinatorics and algebraic and differential geometry is very strong. While researching a problem of Hessian topology, we came across a series of identities of binomial coefficients, which are useful for proving a…
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 introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the…
For a genus g handlebody H a simplicial complex, with vertices being isotopy classes of certain incompressible surfaces in H, is constructed and several properties are established. In particular, this complex naturally contains, as a…
In this paper, we investigate a family of graphs associated to collections of arcs on surfaces. These {\it multiarc graphs} naturally interpolate between arc graphs and flip graphs, both well studied objects in low dimensional geometry and…
Persistent homology is a mathematical tool used for studying the shape of data by extracting its topological features. It has gained popularity in network science due to its applicability in various network mining problems, including…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…
Specific types of spatial defects or potentials can turn monolayer graphene into a topological material. These topological defects are classified by a spatial dimension $D$ and they are systematically obtained from the Hamiltonian by means…
Inspired by several recent papers on the edge ideal of a graph G, we study the equivalent notion of the independence complex of G. Using the tool of vertex decomposability from geometric combinatorics, we show that 5-chordal graphs with no…
We provide first a categorical exploration of, and then completion of the mapping of the relationships among, three fundamental perspectives on binary relations: as the incidence matrices of hypergraphs, as the formal contexts of concept…
The magnitude homology, introduced by R. Hepworth and S. Willerton, offers a topological invariant that enables the study of graph properties. Hypergraphs, being a generalization of graphs, serve as popular mathematical models for data with…
If a graph is in bridge position in a 3-manifold so that the graph complement is irreducible and boundary irreducible, we generalize a result of Bachman and Schleimer to prove that the complexity of a surface properly embedded in the…
In this work, we study the computability of topological graphs, which are obtained by gluing arcs and rays together at their endpoints. We prove that every semicomputable graph in a computable metric space can be approximated, with…
In this paper we are interested in decomposing a dihypergraph $\mathcal{H} = (V, \mathcal{E})$ into simpler dihypergraphs, that can be handled more efficiently. We study the properties of dihypergraphs that can be hierarchically decomposed…
We relate homological properties of a binomial edge ideal $\mathcal{J}_G$ to invariants that measure the connectivity of a simple graph $G$. Specifically, we show if $R/\mathcal{J}_G$ is a Cohen-Macaulay ring, then graph toughness of $G$ is…
We introduce a new topological invariant of complex line arrangements in the complex projective plane, derived from the interaction between their complement and the boundary of a regular neighbourhood. The motivation is to identify Zariski…
In order to make more complex number-based strings from topological coding for defending against the intelligent attacks equipped with quantum computing and providing effective protection technology for the age of quantum computing, we will…
A recent framework for generalizing the Erdos-Ko-Rado Theorem, due to Holroyd, Spencer, and Talbot, defines the Erdos-Ko-Rado property for a graph in terms of the graph's independent sets. Since the family of all independent sets of a graph…