2 citations · 7 across the 12 of their papers we have counts for
4 papers · 1 filter
Switching Checkerboards
David Ellison, Bertrand Jouve, Lewi Stone
In order to study , the set of binary matrices with fixed row and column sums and , we consider sub-matrices of the form $\begin{pmatrix} 1 & 0 \\ 0 & 1 \en…
A hierarchy of dismantlings in Graphs
Etienne Fieux, Bertrand Jouve
Given a finite undirected graph , a vertex is -dismantlable if its open neighbourhood is a cone and is -dismantlable if it is reducible to a single vertex by successiv…
A note on graphs with disjoint maximal cliques ans a link with evasiveness
Etienne Fieux, Bertrand Jouve
In this note, we prove that a finite vertex-transitive graph which has a clique which intersects all maximal cliques is a complete graph. This gives a positive answer in the case o…
Simplicial simple-homotopy of flag complexes in terms of graphs
Romain Boulet, Etienne Fieux, Bertrand Jouve
A flag complex can be defined as a simplicial complex whose simplices correspond to complete subgraphs of its 1-skeleton taken as a graph. In this article, by introducing the notio…