Related papers: A combinatorial $K$-theory perspective on the Edge…
An abundance of real-world problems manifest as covering edges and/or vertices of a graph with cliques that are optimized for some objectives. We consider different structural parameters of graph, and design fixed-parameter tractable…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
Using a result of Vdovina, we may associate to each complete connected bipartite graph $\kappa$ a $2$-dimensional square complex, which we call a tile complex, whose link at each vertex is $\kappa$. We regard the tile complex in two…
Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued (hyper-)graph invariants are considered. The focus of this paper is on fractional edge covers of…
In this article we use existing machinery to define connective $K$-theory spectra associated to topological ringoids. Algebraic $K$-theory of discrete ringoids, and the analytic $K$-theory of Banach categories are obtained as special cases.…
An odd $k$-edge-coloring of a graph $G$ is a (not necessarily proper) edge-coloring with at most $k$ colors such that each non-empty color class induces a graph in which every vertex is of odd degree; similarly, if more than one color per…
Packing and covering problems for metric spaces, and graphs in particular, are of essential interest in combinatorics and coding theory. They are formulated in terms of metric balls of vertices. We consider a new problem in graph theory…
We establish isomorphism ranges for the comparison maps between algebraic and topological K-groups, extending classical Quillen-Lichtenbaum conjecture to separated complex schemes of finite type after refinement. Additionally, we…
We connect two seemingly unrelated problems in graph theory. Any graph $G$ has an associated neighborhood multiset $\mathscr{N}(G)= \{N(x) \mid x\in V(G)\}$ whose elements are precisely the open vertex-neighborhoods of $G$. In general there…
This paper uses the theory of covering graphs to characterize some of the edge-transitive graphs which can arise as token graphs.
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
We unite elements of category theory, K-theory, and geometric group theory, by defining a class of groups called $k$-cube groups, which act freely and transitively on the product of $k$ trees, for arbitrary $k$. The quotient of this action…
We offer a solution to the long-standing problem of group completing within the context of rig categories (also known as bimonoidal categories). Given a rig category R we construct a natural additive group completion R' that retains the…
Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…
This paper, following (Dymetman:1998), presents an approach to grammar description and processing based on the geometry of cancellation diagrams, a concept which plays a central role in combinatorial group theory (Lyndon-Schuppe:1977). The…
K-theory provides a framework for classifying Ramond-Ramond (RR) charges and fields. K-theory of manifolds has a natural extension to K-theory of noncommutative algebras, such as the algebra considered in noncommutative Yang-Mills theory or…
This paper proves the reconstruction conjecture for graphs which are isomorphic to the cube of a tree. The proof uses the reconstructibility of trees from their peripheral vertex deleted subgraphs. The main result follows from (i)…
A reconstruction theorem for genus 0 gravitational quantum cohomology and quantum K-theory is proved. A new linear equivalence in the Picard group of the moduli space of genus 0 stable maps relating the pull-backs of line bundles from the…
An alternative foundation for 2-categories is explored by studying graph-theoretically a partial operation on 2-cells named juncture, which can replace vertical and horizontal composition. Juncture is a generalized vertical composition of…
We propose a geometric and categorical approach to the Hodge Conjecture for all smooth projective complex varieties. By embedding any such variety into a flat family with general fibers smooth complete intersections, we prove the conjecture…