Related papers: Gaps in full homomorphism order

We introduce a taxonomy of interaction types and show that graphs are focal hypergraphs: every graph is canonically a focal hypergraph via its closed neighbourhood structure, and every graph dynamical model is a special case of the general…

For a given graph consider a pair of disjoint matchings the union of which contains as many edges as possible. Furthermore, consider the relation of the cardinalities of a maximum matching and the largest matching in those pairs. It is…

We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…

We describe various path homology theories constructed for a directed hypergraph. We introduce the category of directed hypergraphs and the notion of a homotopy in this category. Also, we investigate the functoriality and the homotopy…

For almost finite groupoids, we study how their homology groups reflect dynamical properties of their topological full groups. It is shown that two clopen subsets of the unit space has the same class in H_0 if and only if there exists an…

The total matching polytope generalizes the stable set polytope and the matching polytope. In this paper, we first propose new facet-defining inequalities for the total matching polytope. We then give an exponential-sized, non-redundant…

Graph comparison is fundamentally important for many applications such as the analysis of social networks and biological data and has been a significant research area in the pattern recognition and pattern analysis domains. Nowadays, the…

In this paper, we are devoted to define p symphonic morphism and characterize it partially as in the case of harmonic morphism.

We show exactness of the homotopy sequence for the logarithmic fundamental group in the case of log smooth, finitely presented, proper and saturated morphisms of fs log schemes over a field. This generalizes earlier results of Hoshi in the…

We generalize the notion of an inverse sequence of graph covers from the zero-dimensional dynamical systems to any dynamical system.

We show that each perfect matching in a bipartite graph $G$ intersects at least half of the perfect matchings in $G$. This result has equivalent formulations in terms of the permanent of the adjacency matrix of a graph, and in terms of…

We define the \emph{occurrence graph} $G_p(\pi$) of a pattern $p$ in a permutation $\pi$ as the graph with the occurrences of $p$ in $\pi$ as vertices and edges between the vertices if the occurrences differ by exactly one element. We then…

We give a sufficient condition on totally disconnected topological graphs such that their associated topological graph algebras are purely infinite.

In this paper we give an algebraic characterization of assemblies in terms of bands of groups. We also consider substructures and homomorphisms of assemblies. We give many examples and counterexamples.

Path graphs are intersection graphs of paths in a tree. We start from the characterization of path graphs by Monma and Wei [C.L.~Monma,~and~V.K.~Wei, Intersection Graphs of Paths in a Tree, J. Combin. Theory Ser. B, 41:2 (1986) 141--181]…

We derive the full phase diagram for a large family of two-parameter exponential random graph models, each containing a first order transition curve ending in a critical point.

The defect morphology is an essential aspect of the evolution of crystals' microstructure and its response to stress. Existing methods either only report defect concentration or characterize only some of the defect morphologies. The need…

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…

We prove that the algebra of invariants of a complete path algebra under the action of a homogeneous group of continuous algebra automorphisms is a complete path algebra and preserves finite or tame representation type.

An algebraic deformation theory of coalgebra morphisms is constructed.