Related papers: Graphs, hypergraphs, and properads
The Heawood graph is a remarkable graph that played a fundamental role in the development of the theory of graph colorings on surfaces in the 19th and 20th centuries. Based on permutahedral tilings, we introduce a generalization of the…
The sandpile group of a graph is a well-studied object that combines ideas from algebraic graph theory, group theory, dynamical systems, and statistical physics. A graph's sandpile group is part of a larger algebraic structure on the graph,…
Categorical probability has recently seen significant advances through the formalism of Markov categories, within which several classical theorems have been proven in entirely abstract categorical terms. Closely related to Markov categories…
We demonstrate how to generalize two of the most well-known random graph models, the classic random graph, and random graphs with a given degree distribution, by the introduction of hidden variables in the form of extra degrees of freedom,…
Graph theory provides fundamental concepts for many fields of science like statistical physics, network analysis and theoretical computer science. Here we give a pedagogical introduction to graph theory, divided into three sections. In the…
We provide a new approach to categorical graph and hypergraph theory by using categorical syntax and semantics. For each monoid $M$ and action on a set $X$, there is an associated presheaf topos of $(X,M)$-graphs where each object can be…
For real application and theoretical investigation of ordinary hypergraphs and non-ordinary hypergraphs, researchers need to establish standard rules and feasible operating methods. We propose a visualization tool for investigating…
We define a covering of a profinite graph to be a projective limit of a system of covering maps of finite graphs. With this notion of covering, we develop a covering theory for profinite graphs which is in many ways analogous to the…
A directed hypergraph (dihypergraph) consists of a set of vertices and a set of hyperarcs, where each hyperarc is partitioned into a head and a tail. Directed hypergraphs are useful in many applications, including the study of chemical…
We generalize the fundamental graph-theoretic notion of chordality for higher dimensional simplicial complexes by putting it into a proper context within homology theory. We generalize some of the classical results of graph chordality to…
Graphs are important data representations for describing objects and their relationships, which appear in a wide diversity of real-world scenarios. As one of a critical problem in this area, graph generation considers learning the…
We give a sharp bound for the automorphism group of a cubic simple graph with a given number of vertices. For each number of vertices we give an explicit graph attaining the bound, and prove its uniqueness in special cases.
In this paper, we introduce the concepts of the plain eigenvalue, the main-plain index and the refined spectrum of graphs. We focus on the graphs with two main and two plain eigenvalues and give some characterizations of them.
We characterize the vertices belonging to all minimum dominating sets, to some minimum dominating sets but not all, and to no minimum dominating set. We refine this characterization for some well studied sub-classes of graphs: chordal,…
In this paper we investigate the $directed$ $normalizing$ $graph$ associated with a group $G$, defined as the simple directed graph whose vertices are the elements of $G$, with an arrow from $x$ to $y$ whenever the subgroup $\langle x…
We generalize the concept of token graphs to obtain supertoken graphs. In the latter case, there can be more than one token in a vertex. We formally define supertoken graphs and establish their basic properties. Moreover, we provide some…
We introduce the notion of recurrence and transience for graphs over non-Archimedean ordered field. To do so we relate these graphs to random walks of directed graphs over the reals. In particular, we give a characterization of the real…
Metric graphs are often introduced based on combinatorics, upon "associating" each edge of a graph with an interval; or else, casually "gluing" a collection of intervals at their endpoints in a network-like fashion. Here we propose an…
A directed graph is set-homogeneous if, whenever U and V are isomorphic finite subdigraphs, there is an automorphism g of the digraph with U^g=V. Here, extending work of Lachlan on finite homogeneous digraphs, we classify finite…
The literature on word-representable graphs is quite rich, and a number of variations of the original definition have been proposed over the years. We are initiating a systematic study of such variations based on formal languages. In our…