Recherche

We study biased Maker-Breaker games on a graph system {G1,…,Gs}, in which Maker's goal is to claim certain rainbow structures, i.e., specified

Using the Graph Minor Theorem, by Robertson and Seymour, one can easily prove that there are only a finite number of excluded minors for a given

Vérifiez que vous êtes bien inscrits sur le site du [gdr-ifm-gt-graphes] : [ https://gtgraphes.labri.fr/pmwiki/pmwiki.php/Equipes/Equipes#membres |

Hex is a board game, where two players take turns placing red and blue stones respectively on a rhombus-shaped board with hexagonal cells, with the

Strong flip-flatness has emerged as a natural dense analogue of uniform almost-wideness in the context of preservation theorems, but its combinatorial

In computational biology, phylogenetics is the study of evolutionary histories, their reconstruction from data, their comparison, and interaction

In the Demand Strip Packing problem (DSP), we are given a finite set of axis-aligned rectangular items, each characterized by a specific width and

Given a graph $G$ and an integer $k \geq 2$, let $\chi'_k(G)$ denote the minimum number of colours required to colour the edges of $G$ such that, in

In graph modification problems, we want to modify a graph through some operation (e.g. vertex/edge deletion/addition/contraction) to obtain a graph

A central concept in social choice theory is that of a Condorcet winner: an outcome that defeats every alternative in a pairwise majority vote. While