HBHector Buffière

Hector Buffière

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Hector Buffière has a total of 7 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Characterizations of monadically dependent tree-ordered weakly sparse structures

    by Hector Buffière, Yuquan Lin, Jaroslav NešetřIl, Patrice Ossona de Mendez, Sebastian Siebertz

    A class of structures is monadically dependent if one cannot interpret all graphs in colored expansions from the class using a fixed first-order formula. A tree-ordered $σ$-structure is the expansion of a $σ$-structure with a tree-order. A tree-ordered $σ$-structure is weakly sparse if the Gaifman graph of its $σ$-reduct excludes some biclique (of a given fixed size) as a subgraph. Tree-ordered weakly sparse graphs are commonly used as tree-models (for example for classes with bounded shrubdepth, structurally bounded expansion, bounded cliquewidth, or bounded twin-width), motivating their study on their own. In this paper, we consider several constructions on tree-ordered structures, such as tree-ordered variants of the Gaifman graph and of the incidence graph, induced and non-induced tree-ordered minors, and generalized fundamental graphs. We provide characterizations of monadically dependent classes of tree-ordered weakly sparse $σ$-structures based on each of these constructions, some of them establishing unexpected bridges with sparsity theory. As an application, we prove that a class of tree-ordered weakly sparse structures is monadically dependent if and only if its sparsification is nowhere-dense. Moreover, the sparsification transduction translates boundedness of clique-width and linear clique-width into boundedness of tree-width and path-width. We also prove that first-order model checking is not fixed parameter tractable on independent hereditary classes of tree-ordered weakly sparse graphs (assuming $\mathsf{AW}[*]\neq \mathsf{FPT}$) and give what we believe is the first model-theoretical characterization of classes of graphs excluding a minor, thus opening a new perspective of structural graph theory.

  • Open Access

    Blind cop-width and balanced minors of graphs

    by Hector Buffière, Rutger Campbell, Kevin Hendrey, Sang-Il Oum

    We investigate a pursuit-evasion game on an undirected graph in which a robber, moving at a fixed constant speed, attempts to evade a team of cops who are blind to the robber's location and can quickly travel between any pair of vertices in the graph. The blind cop-width is the minimum number of cops needed to catch the robber on a given graph. We link it with other known graph parameters defined in terms of pursuit-evasion games, and show a new lower bound with respect to treewidth. The proof introduces the notion of balanced minors, where all branch sets of a minor model have equal size.