Add to ORKGThe investigation of structure in marker sequences has been a recurring theme of the study of countable Borel equivalence relations and Borel graphs. Suppose Γ is a finitely generated group which acts on the space 2Γ via the left shift action. Let Free(2Γ) be the set of x ∈ 2Γ such that for all nonidentit
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...
International audienceIn recent years, the theory behind distance functions defined by neighbourhood...
Two sets of points in d-dimensional space are given: a data set D consisting of N points, and a patt...
An L(2, 1)-labelling of a graph G is a function f from the vertex set V(G) to the set of all nonnega...
AbstractIt is shown that, contrary to a pair of well-known conjectures, there exist finite and infin...
Part 1: Consider a continuous action of a countable group G on a Polish space X. A countable Borel p...
A Langford sequence of order m and defect d can be identified with a labeling of the vertices of a p...
This project investigates problems involving the concept of distance in graph theory. Applications o...
If Γ is an infinite group with finite symmetric generating set S, we consider the graph G(Γ, S) on [...
The cut pseudo-metric on the space of graph limits induces an equivalence relation. The quotient spa...
We define Ak-moves for embeddings of a finite graph into the 3-sphere for each natural number k. Let...
International audienceWe introduce a novel notion of local spectral gap for general, possibly infini...
Using the classification of the finite simple groups, we classify all finite generalized polygons ha...
AbstractFor given positive integers j≥k, an L(j,k)-labeling of a graph G is a function f:V(G)→{0,1,2...
International audienceThe Besicovitch pseudodistance defined in [1] for biinfinite sequences is inva...
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...
International audienceIn recent years, the theory behind distance functions defined by neighbourhood...
Two sets of points in d-dimensional space are given: a data set D consisting of N points, and a patt...
An L(2, 1)-labelling of a graph G is a function f from the vertex set V(G) to the set of all nonnega...
AbstractIt is shown that, contrary to a pair of well-known conjectures, there exist finite and infin...
Part 1: Consider a continuous action of a countable group G on a Polish space X. A countable Borel p...
A Langford sequence of order m and defect d can be identified with a labeling of the vertices of a p...
This project investigates problems involving the concept of distance in graph theory. Applications o...
If Γ is an infinite group with finite symmetric generating set S, we consider the graph G(Γ, S) on [...
The cut pseudo-metric on the space of graph limits induces an equivalence relation. The quotient spa...
We define Ak-moves for embeddings of a finite graph into the 3-sphere for each natural number k. Let...
International audienceWe introduce a novel notion of local spectral gap for general, possibly infini...
Using the classification of the finite simple groups, we classify all finite generalized polygons ha...
AbstractFor given positive integers j≥k, an L(j,k)-labeling of a graph G is a function f:V(G)→{0,1,2...
International audienceThe Besicovitch pseudodistance defined in [1] for biinfinite sequences is inva...
summary:In 1986, Chartrand, Saba and Zou [3] defined a measure of the distance between (the isomorph...
International audienceIn recent years, the theory behind distance functions defined by neighbourhood...
Two sets of points in d-dimensional space are given: a data set D consisting of N points, and a patt...