Related papers: A combinatorial $K$-theory perspective on the Edge…
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…
k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop the theory of covering spaces for k-graphs, obtaining a…
We introduce filtered algebraic $K$-theory of a ring $R$ relative to a sublattice of ideals. This is done in such a way that filtered algebraic $K$-theory of a Leavitt path algebra relative to the graded ideals is parallel to the gauge…
The graph reconstruction conjecture asserts that every simple graph on at least three vertices is uniquely determined by its deck of vertex-deleted subgraphs. In this expository article we survey the conjecture and present an…
We prove that a large family of graphs which are decomposable with respect to the modular decomposition can be reconstructed from their collection of vertex-deleted subgraphs.
Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question…
Using the Evans spectral sequence and its counter-part for real $K$-theory, we compute both the real and complex $K$-theory of several infinite families of $C^*$-algebras based on higher-rank graphs of rank $3$ and $4$. The higher-rank…
The Fundamental Morphism Theorem is a categorical version of the First Noether Isomorphism Theorem for categories that do not have kernels or cokernels. We consider two categories of graphs. Both categories will admit graphs with multiple…
We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…
We demonstrate how category theory provides specifications that can efficiently be implemented via imperative algorithms and apply this to the field of graph rewriting. By examples, we show how this paradigm of software development makes it…
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…
In this paper, we define an invariant, which we believe should be the substitute for total K-theory in the case when there is one distinguished ideal. Moreover, some diagrams relating the new groups to the ordinary K-groups with…
The aim of this work is to explicitly compute the K-theory of the category of matroids with respect to the covering family of Tutte coverings. In particular, we show that this is equivalent to the K-theory spectrum of the category of…
The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
In the field of parameterized complexity theory, the study of graph width measures has been intimately connected with the development of width-based model checking algorithms for combinatorial properties on graphs. In this work, we…
A modified $k$-deck of a graph $G$ is obtained by removing $k$ edges of $G$ in all possible ways, and adding $k$ (not necessarily new) edges in all possible ways. Krasikov and Roditty asked if it was possible to construct the usual $k$-edge…
We introduce a categorical formalism for rewriting surface-embedded graphs. Such graphs can represent string diagrams in a non-symmetric setting where we guarantee that the wires do not intersect each other. The main technical novelty is a…
We show that if a graph is k-edge-connected, and we adjoin to it another graph satisfying a "contracted diameter less or equal to 2" condition, with minimal degree greater or equal to k, and some natural hypothesis on the edges connecting…
Regular algebraic $K$-theory for groups is a homology theory for discrete groups closely connected (but different from) group homology. It also gives a version of algebraic $K$-theory for rings by the simple functorial mapping assigning to…