Related papers: A strong geometric hyperbolicity property for dire…
Graphons are analytic objects associated with convergent sequences of dense graphs. Finitely forcible graphons, i.e., those determined by finitely many subgraph densities, are of particular interest because of their relation to various…
This paper presents sufficient graph-theoretic conditions for injectivity of collections of differentiable functions on rectangular subsets of R^n. The results have implications for the possibility of multiple fixed points of maps and…
In graph theory, Courcelle's theorem essentially states that, if an algorithmic problem can be formulated in monadic second-order logic, then it can be solved in linear time for graphs of bounded treewidth. We prove such a metatheorem for a…
We describe a procedure which verifies that a group given by generators and relators is word-hyperbolic. This procedure always works with a group which is word-hyperbolic, provided there is sufficient memory and time devoted to the problem.…
An approach to the enumeration of feasible parameters for strongly regular graphs is described, based on the pair of structural parameters (a,c) and the positive eigenvalue e. The Krein bound ensures that there are only finitely many…
A graph product kernel means the kernel of the natural surjection from a graph product to the corresponding direct product. We prove that a graph product kernel of countable groups is special, and a graph product of finite or cyclic groups…
Recent papers in the graph machine learning literature have introduced a number of approaches for hyperbolic representation learning. The asserted benefits are improved performance on a variety of graph tasks, node classification and link…
We show that for some absolute (explicit) constant $C$, the following holds for every finitely generated group $G$, and all $d >0$: If there is some $ R_0 > \exp(\exp(Cd^C))$ for which the number of elements in a ball of radius $R_0$ in a…
The fundamental group of a closed irreducible 3-dimensional manifold has the Rapid Decay property if and only if it is not virtually Sol. This is proved by studying distortion of length functions in graphs of groups, and the stability of…
Motivated by conjectures of Demailly, Green-Griffiths, Lang, and Vojta, we show that several notions related to hyperbolicity behave similarly in families. We apply our results to show the persistence of arithmetic hyperbolicity along field…
We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…
A mixed graph $G$ is a graph that consists of both undirected and directed edges. An orientation of $G$ is formed by orienting all the undirected edges of $G$, i.e., converting each undirected edge $\{u,v\}$ into a directed edge that is…
We prove that a map onto a nilpotent group $Q$ has finitely generated kernel if and only if the preimage of the positive cone is coarsely connected as a subset of the Cayley graph for every full archimedean partial order on $Q$. In case $Q$…
This paper shows that a finitely presented monoid with linear Dehn function need not have a regular cross-section, strengthening the previously-known result that such a monoid need not be presented by a finite complete string rewriting…
We study the right-angled Artin group action on the extension graph. We show that this action satisfies a certain finiteness property, which is a variation of a condition introduced by Delzant and Bowditch. As an application we show that…
We consider the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent open problem in NP-completeness. We present a number of new polynomial…
Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive…
The core challenge in a Hoare- or Dijkstra-style proof system for graph programs is in defining a weakest liberal precondition construction with respect to a rule and a postcondition. Previous work addressing this has focused on assertion…
We consider a variant of metrised graphs where the edge lengths take values in a commutative monoid, as a higher-rank generalisation of the notion of a tropical curve. Divisorial gonality, which Baker and Norine defined on combinatorial…
The Kohayakawa-Nagle-R\"odl-Schacht conjecture roughly states that every sufficiently large locally $d$-dense graph $G$ on $n$ vertices must contain at least $(1-o(1))d^{|E(H)|}n^{|V(H)|}$ copies of a fixed graph $H$. Despite its important…