Related papers: Differentials on Forested and Hairy Graph Complexe…
We consider constrained variants of graph homomorphisms such as embeddings, monomorphisms, full homomorphisms, surjective homomorpshims, and locally constrained homomorphisms. We also introduce a new variation on this theme which derives…
Treewidth is a parameter that emerged from the study of minor closed classes of graphs (i.e. classes closed under vertex and edge deletion, and edge contraction). It in some sense describes the global structure of a graph. Roughly, a graph…
How does neural connectivity in autistic children differ from neural connectivity in healthy children or autistic youths? What patterns in global trade networks are shared across classes of goods, and how do these patterns change over time?…
Different techniques from machine learning are applied to the problem of computing line bundle cohomologies of (hypersurfaces in) toric varieties. While a naive approach of training a neural network to reproduce the cohomologies fails in…
We introduce the notion of cofoliation on a stack. A cofoliation is a change of the differentiable structure which amounts to giving a full representable smooth epimorphism. Cofoliations are uniquely determined by their associated Lie…
In recent years many algorithms have been developed for finding patterns in graphs and networks. A disadvantage of these algorithms is that they use subgraph isomorphism to determine the support of a graph pattern; subgraph isomorphism is a…
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…
We consider the following problem closely related to graph isomorphism. In a simplified version, the task is to compute the automorphism group of a given set family (or a hypergraph), that is, the group of all automorphisms of the given…
A suitable extra differential on graph complexes can lead to a pairing of its cohomological classes. Many such extra differentials are known for various graph complexes, including Kontsevich's graph complex $GC_n$ for odd $n$. In this paper…
We establish the homological foundations for studying polynomially bounded group cohomology, and show that the natural map from PH^*(G;Q) to H^*(G;Q) is an isomorphism for a certain class of groups.
A new heuristic based on vertex invariants is developed to rapidly distinguish non-isomorphic graphs to a desired level of accuracy. The method is applied to sample subgraphs from an E.coli protein interaction network, and as a probe for…
We present novel graph kernels for graphs with node and edge labels that have ordered neighborhoods, i.e. when neighbor nodes follow an order. Graphs with ordered neighborhoods are a natural data representation for evolving graphs where…
In this paper we will apply the tensor and its traces to investigate the spectral characterization of unicyclic graphs. Let $G$ be a graph and $G^m$ be the $m$-th power (hypergraph) of $G$. The spectrum of $G$ is referring to its adjacency…
We show that all the tangles in a finite graph or matroid can be distinguished by a single tree-decomposition that is invariant under the automorphisms of the graph or matroid. This comes as a corollary of a similar decomposition theorem…
We introduce a new method to construct uncountably chromatic graphs from non special trees and ladder systems. Answering a question of P. Erd\H{o}s and A. Hajnal from 1985, we construct graphs of chromatic number $\omega_1$ without…
Two graphs $G$ and $H$ are homomorphism indistinguishable over a family of graphs $\mathcal{F}$ if for all graphs $F \in \mathcal{F}$ the number of homomorphisms from $F$ to $G$ is equal to the number of homomorphism from $F$ to $H$. Many…
We show that every sheaf on the site of smooth manifolds with values in a stable (infinity,1)-category (like spectra or chain complexes) gives rise to a differential cohomology diagram and a homotopy formula, which are common features of…
The observation that a graph of rank $n$ can be assembled from graphs of smaller rank $k$ with $s$ leaves by pairing the leaves together leads to a process for assembling homology classes for $Out(F_n)$ and $Aut(F_n)$ from classes for…
We investigate the asymptotic number of induced subgraphs in power-law uniform random graphs. We show that these induced subgraphs appear typically on vertices with specific degrees, which are found by solving an optimization problem.…
We give a decomposition of the suspension of a polyhedral join in terms of the polyhedral smash product of the suspension of the family of pairs, and study some cases in which the formula can be desuspended, particularly for polyhedral…