Related papers: Graphs for Juncture
In this paper, we extend Ocneanu's theory of connections on graphs to define a 2-category whose 0-cells are tracial Bratteli diagrams, and whose 1-cells are generalizations of unitary connections. We show that this 2-category admits an…
The notion of pseudocategory, as considered in [11], is extended from the context of a 2-category to the more general one of a sesquicategory, which is considered as a category equipped with a 2-cell structure. Some particular examples of…
We introduce a formalism based on a combinatorial notion of cell complex subject to an inclusion-reversing duality operation. Our main goal is to open the way for a functorial definition of field theories in a context where no manifold or…
As an example of the categorical apparatus of pseudo algebras over 2-theories, we show that pseudo algebras over the 2-theory of categories can be viewed as pseudo double categories with folding or as appropriate 2-functors into…
When a category is equipped with a 2-cell structure it becomes a sesquicategory but not necessarily a 2-category. It is widely accepted that the latter property is equivalent to the middle interchange law. However, little attention has been…
In this paper we redevelop the foundations of the category theory of quasi-categories (also called infinity-categories) using 2-category theory. We show that Joyal's strict 2-category of quasi-categories admits certain weak 2-limits, among…
This paper develops a fundamental theory of realizations of linear and group codes on general graphs using elementary group theory, including basic group duality theory. Principal new and extended results include: normal realization…
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.…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two sets of entities (vertices) are placed on two parallel lines…
We define a bicategory in which the 0-cells are the entwinings over variable rings. The 1-cells are triples of a bimodule and two maps of bimodules which satisfy an additional hexagon, two pentagons and two (co)unit triangles; and the…
In this work we study how some elementary graph operations (like the disjoint union) and the collapse of two vertices modify the cut ideal of a graph. They pave the way for reducing the cut ideal of every graph to the cut ideal of smaller…
A $k$-subcoloring of a graph is a partition of the vertex set into at most $k$ cluster graphs, that is, graphs with no induced $P_3$. 2-subcoloring is known to be NP-complete for comparability graphs and three subclasses of planar graphs,…
A 2-tree is a graph that can be formed by starting with a triangle and iterating the operation of making a new vertex adjacent to two adjacent vertices of the existing graph. Leizhen Cai asked in 1995 whether every maximal planar graph…
The aim of this article is to provide space level maps between configuration spaces of graphs that are predicted by algebraic manipulations of cellular chains. More explicitly, we consider edge contraction and half-edge deletion, and…
Poly-bicategories generalise planar polycategories in the same way as bicategories generalise monoidal categories. In a poly-bicategory, the existence of enough 2-cells satisfying certain universal properties (representability) induces…
This paper adresses two issues in dealing with bicategories of fractions. The first is to introduce a set of conditions on a class of arrows in a bicategory which is weaker than the one given in Pronk, Etendues and stacks as bicategories of…
We develop further the theory of operads and analytic functors. In particular, we introduce a bicategory that has operads as 0-cells, operad bimodules as 1-cells and operad bimodule maps as 2-cells, and prove that this bicategory is…
In this paper we develop a structure called Link Algebra, in which we present a Set with two binary operations and an axiom system developed from the study of graph theory and set/antiset theory, sowing main theorems and definitions. Once…
A nut graph is a simple graph whose kernel is spanned by a single full vector (i.e. the adjacency matrix has a single zero eigenvalue and all non-zero kernel eigenvectors have no zero entry). We classify generalisations of nut graphs to nut…