Related papers: Gaps in full homomorphism order
In this note, finite type epimorphisms of rings are characterized.
We find all polyhedral graphs such that their complements are still polyhedral. These turn out to be all self-complementary.
We establish a characterization of the extraordinary dimension of perfect maps between metrizable spaces.
The purpose of this paper is to study deformation theory of Hom-associative algebra morphisms and Hom-Lie algebra morphisms. We introduce a suitable cohomology and discuss Infinitesimal deformations, equivalent deformations and…
We generalize the enhanced power graph by replacing elements with classes under automorphisms. We show that the connectivity and diameter of this graph is similar to that of the enhanced power graph. We consider the universal vertices of…
We survey the theory of totally symmetric sets, with applications to homomorphisms of symmetric groups, braid groups, linear groups, and mapping class groups.
A heterogeneous graph consists of different vertices and edges types. Learning on heterogeneous graphs typically employs meta-paths to deal with the heterogeneity by reducing the graph to a homogeneous network, guide random walks or capture…
We study P-groupoids that arise from certain decompositions of complete graphs. We show that left distributive P-groupoids are distributive, quasigroups. We characterize P-groupoids when the corresponding decomposition is a Hamiltonian…
The method of range decreasing group homomorphisms can be applied to study various maps between mapping spaces, includin holomorphic maps, group homomorphisms, linear maps, semigroup homomorphisms, Lie algebra homomorphisms and algebra…
We generalize subgraph densities, arising in dense graph limit theory, to Markov spaces (symmetric measures on the square of a standard Borel space). More generally, we define an analogue of the set of homomorphisms in the form of a measure…
Getting inspired by the famous no-three-in-line problem and by the general position subset selection problem from discrete geometry, the same is introduced into graph theory as follows. A set $S$ of vertices in a graph $G$ is a general…
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
Consider a family $\mathcal F$ of $C_{2r+1}$-free graphs, where $r\geq 2$. Suppose that each graph in $\mathcal F$ has minimum degree linear in its number of vertices. Thomassen showed that such a family has bounded chromatic number, or,…
A large driver of the complexity of graph learning is the interplay between structure and features. When analyzing the expressivity of graph neural networks, however, existing approaches ignore features in favor of structure, making it…
The Paley graph is a well-known self-complementary pseudo-random graph, defined over a finite field of odd order. We describe an attempt at an analogous construction using fields of even order. Some properties of the graph are noted, such…
Path graphs are intersection graphs of paths in a tree.~In this paper we give a "6\ good characterization" of path graphs, namely, we prove that path graph membership is in $NP\cap CoNP$ without resorting to existing polynomial time…
We develop an obstruction theory for the existence of gauge equivalences in complete differential graded Lie algebras. Specifically, this theory provides a characterization of homotopy equivalences between differential graded algebras…
We describe proper actors from the underlying groupoid of a graph C*-algebra to another \'etale groupoid in terms of bisections. This allows to understand graph morphisms and the *-homomorphisms that they induce more conceptually. More…
We investigate three formalisms to specify graph languages, i.e. sets of graphs, based on type graphs. First, we are interested in (pure) type graphs, where the corresponding language consists of all graphs that can be mapped…
A geometric graph is a graph whose vertex set is a set of points in the plane and whose edge set contains straight-line segments. A matching in a graph is a subset of edges of the graph with no shared vertices. A matching is called perfect…