In <cit.>, the authors have shown a characterization of the extremal
fam...
Given a family S of k–subsets of [n], its lower shadow Δ(S) is
the famil...
Vertex bisection is a graph partitioning problem in which the aim is to ...
The theory of rapid mixing random walks plays a fundamental role in the ...
A partial order is universal if it contains every countable partial orde...
We introduce the Multicolored Graph Realization problem (MGRP). The inpu...
List k-Coloring (Li k-Col) is the decision problem asking if a given gra...
The connection between inequalities in additive combinatorics and analog...