Related papers: Canonical graph decompositions via coverings
Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a procedure for turning the underlying space into a compact metric…
We introduce a graph decomposition which exists for all simple, connected graphs $G=(V,E)$. The decomposition $V = A \cup B \cup C$ is such that each vertex in $A$ has more neighbors in $B$ than in $A$ and vice versa. $C$ is `balanced':…
We consider the class of the topologically locally finite (in short TLF) planar vertex-transitive graphs, a class containing in particular all the one-ended planar Cayley graphs and the normal transitive tilings. We characterize these…
We give a short, topological proof that all graphs admit tree-decompositions displaying their topological ends.
Full Bayesian computational inference for model determination in undirected graphical models is currently restricted to decomposable graphs, except for problems of very small scale. In this paper we develop new, more efficient methodology…
The Tree Decomposition Conjecture by Bar\'at and Thomassen states that for every tree $T$ there exists a natural number $k(T)$ such that the following holds: If $G$ is a $k(T)$-edge-connected simple graph with size divisible by the size of…
In this paper authors consider representations of graphs in Hilbert spaces applying a restriction of local scalarity on them. It enables to obtain a theory, similar to the classical theory of representations of graphs in vector spaces. In…
A transitive decomposition of a graph is a partition of the edge or arc set giving a set of subgraphs which are preserved and permuted transitively by a group of automorphisms of the graph. In this paper we give some background to the study…
We present simple graph-theoretic characterizations of Cayley graphs for left-cancellative monoids, groups, left-quasigroups and quasigroups. We show that these characterizations are effective for the end-regular graphs of finite degree.
A triangle decomposition of a graph is a partition of its edges into triangles. A fractional triangle decomposition of a graph is an assignment of a non-negative weight to each of its triangles such that the sum of the weights of the…
We present a constraint model for the problem of producing a tree decomposition of a graph. The inputs to the model are a simple graph G, the number of nodes in the desired tree decomposition and the maximum cardinality of each node in that…
A locally irregular graph is a graph whose adjacent vertices have distinct degrees, a regular graph is a graph where each vertex has the same degree and a locally regular graph is a graph where for every two adjacent vertices u, v, their…
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…
We consider local-global principles for torsors under linear algebraic groups, over function fields of curves over complete discretely valued fields. The obstruction to such a principle is a version of the Tate-Shafarevich group; and for…
Perception research provides strong evidence in favor of part based representation of shapes in human visual system. Despite considerable differences among different theories in terms of how part boundaries are found, there is substantial…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
When one studies geometric properties of graphs, local finiteness is a common implicit assumption, and that of transitivity a frequent explicit one. By compactness arguments, local finiteness guarantees several regularity properties. It is…
The question of whether there is a logic that captures polynomial time is one of the main open problems in descriptive complexity theory and database theory. In 2010 Grohe showed that fixed point logic with counting captures polynomial time…
In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This…
We study differential forms on an algebraic compactification of a moduli space of metric graphs. Canonical examples of such forms are obtained by pulling back invariant differentials along a tropical Torelli map. The invariant differential…