6 citations · 9 across the 7 of their papers we have counts for
8 papers
Noncommutative properties of 0-hyperbolic graphs
Amaury Freslon, Paul Meunier, Pegah Pournajafi
We study several noncommutative properties of 0-hyperbolic graphs. In particular, we prove that 0-hyperbolicity is preserved under quantum isomorphism. We also compute the quantum…
Block structures of graphs and quantum isomorphism
Amaury Freslon, Paul Meunier, Pegah Pournajafi
We prove that for every pair of quantum isomorphic graphs, their block trees and their block graphs are isomorphic, and that such an isomorphism can be chosen so that the correspon…
Vertex gluing preserves the bunkbed conjecture
Paul Meunier, Pegah Pournajafi
We prove that the bunkbed conjecture is preserved under gluing along a vertex. As a consequence, every minimal counterexample is 2-connected. More generally, for any class of graph…
Burling graphs as intersection graphs
Pegah Pournajafi
For a subset of , -graphs are the intersection graphs of specific transformations of . The class of Burling graphs is a class of triangle-free graphs w…
Lower bound for constant-size local certification
Virgina Ardévol Martínez, Marco Caoduro, Laurent Feuilloley +3
Given a network property or a data structure, a local certification is a labeling that allows to efficiently check that the property is satisfied, or that the structure is correct.…
Burling graphs revisited, part III: Applications to -boundedness
Pegah Pournajafi, Nicolas Trotignon
The Burling sequence is a sequence of triangle-free graphs of unbounded chromatic number. The class of Burling graphs consists of all the induced subgraphs of the graphs of this se…
Burling graphs revisited, part II: Structure
Pegah Pournajafi, Nicolas Trotignon
The Burling sequence is a sequence of triangle-free graphs of increasing chromatic number. Any graph which is an induced subgraph of a graph in this sequence is called a Burling gr…
Burling graphs revisited, part I: New characterizations
Pegah Pournajafi, Nicolas Trotignon
The Burling sequence is a sequence of triangle-free graphs of increasing chromatic number. Each of them is isomorphic to the intersection graph of a set of axis-parallel boxes in $…