Search

In order to further develop the theory of packing trees and packing forests in an undirected graph, we extended the notion of supermodular functions

In the first paper of the Graph Minors series [JCTB ’83], Robertson and Seymour proved the Forest Minor theorem: the H-minor-free graphs have bounded

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

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 the Demand Strip Packing problem (DSP), we are given a finite set of axis-aligned rectangular items, each characterized by a specific width and

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