Let s and t be positive integers. We use P_t to denote the path with
t v...
For a graph F, a graph G is F-free if it does not contain an
induced sub...
We study the Max Partial H-Coloring problem: given a graph G,
find the l...
This paper investigates entropic matroids, that is, matroids whose rank
...
We study the disproportionate version of the classical cake-cutting prob...
Let T be a tree such that all its vertices of degree more than two lie o...
This is the second paper in a series of two. The goal of the series is t...
This is the first paper in a series whose goal is to give a polynomial t...