Related papers: Two monads for graphs
The representation of graphs is commonly based on the adjacency matrix concept. This formulation is the foundation of most algebraic and computational approaches to graph processing. The advent of deep learning language models offers a wide…
We extend Wood's graph theoretic interpretation of certain quotients of the mod $2$ dual Steenrod algebra to quotients of the mod $p$ dual Steenrod algebra where $p$ is an odd prime and to quotients of the $C_2$-equivariant dual Steenrod…
Polytopes from subgraph statistics are important in applications and conjectures and theorems in extremal graph theory can be stated as properties of them. We have studied them with a view towards applications by inscribing large explicit…
This paper introduces a geometric representation of hypergraphs by representing hyperedges as simplices. Building on this framework, we employ homotopy groups to analyze the topological structure of hypergraphs embedded in high-dimensional…
We provide proofs certifying that the structure theorem for vertex sets of bounded bidimensionality holds with polynomial bounds. The bidimensionality of vertex sets is a common generalisation of both treewidth and the face-cover-number of…
The ribbon group action extends geometric duality and Petrie duality by defining two embedded graphs as twisted duals precisely when they lie within the same orbit under this group action. Twisted duality yields numerous novel properties of…
We apply the notion of 2-extensions of algebras to the deformation theory of algebras. After standard results on butterflies between 2-extensions, we use this (2, 0)-category to give three perspectives on the deformation theory of algebras.…
In this paper we introduce a class of hypergraphs that we call chordal. We also extend the definition of triangulated hypergraphs, given in \cite{VT}, so that a triangulated hypergraph, according to our definition, is a natural…
We offer a new perspective on the closed graph theorem and the open mapping theorem for separated barrelled spaces and fully complete spaces.
This work presents a detailed analysis of the combinatorics of modular operads. These are operad-like structures that admit a contraction operation as well as an operadic multiplication. Their combinatorics are governed by graphs that admit…
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…
In this note, we consider connected graphs with exactly two main eigenvalues. We will give several constructions for them, and as a consequence we show a family of those graphs with an unbounded number of distinct valencies.
Motivated by affine Schubert calculus, we construct a family of dual graded graphs $(\Gamma_s,\Gamma_w)$ for an arbitrary Kac-Moody algebra $\g(A)$. The graded graphs have the Weyl group $W$ of $\g(A)$ as vertex set and are labeled versions…
We consider hypergraph visualizations that represent vertices as points in the plane and hyperedges as curves passing through the points of their incident vertices. Specifically, we consider several different variants of this problem by (a)…
Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs,…
This is an expository article about operads in homotopy theory written as a chapter for an upcoming book. It concentrates on what the author views as the basic topics in the homotopy theory of operadic algebras: the definition of operads,…
Knopfmacher et all [1] was introduced the graph compositions` notion. In this note we add to these a new construction of tree-like graphs where nodes are graphs themselves. The first examples of these tree-like compositions, a corresponding…
I introduce a class of diagrams in a Grothendieck site called "atlases" which can be used to study hyperdescent, and show that hypersheaves take atlases to limits using an indexed `nerve' construction that produces hypercovers from atlases.…
We observe that for planar graphs, the geometric duality relation generates both 2-isomorphism and abstract duality. This observation has the surprising consequence that for links, the equivalence relation defined by isomorphisms of…
This paper is an introduction to mould calculus as introduced by Jean Ecalle. We give a precise definition of moulds and describe there main properties. We translate mould symmetries (alterna(e)l and symetra(e)l) using non commutative…