1 citations · 2 across the 8 of their papers we have counts for
4 papers · 1 filter
Generating minimal redundant and maximal irredundant sets in incidence graphs
Emanuel Castelo, Jérémie Chalopin, Oscar Defrain +1
It has been proved by Boros and Makino that there is no output-polynomial-time algorithm enumerating the minimal redundant sets or the maximal irredundant sets of a hypergraph, unl…
Boundary rigidity of systolic and Helly complexes
Martín Blufstein, Jérémie Chalopin, Victor Chepoi
In this article, we prove that finite (weakly) systolic and Helly complexes can be reconstructed from their boundary distances (computed in their 1-skeleta). Furthermore, Helly com…
Geometry of convex geometries
Jérémie Chalopin, Victor Chepoi, Kolja Knauer
We prove that any convex geometry on points and any ideal of can be realized as the intersection pat…
Boundary rigidity of finite CAT(0) cube complexes
Jérémie Chalopin, Victor Chepoi
In this note, we prove that finite CAT(0) cube complexes can be reconstructed from their boundary distances (computed in their 1-skeleta). This result was conjectured by Haslegrave…