5 problems

The paper studies a hierarchy of sufficient conditions for positivity of the avoidance probability, with bounds on the negative-fugacity singularity obtained by choosing an integer…

The deterministic Lovász Local Lemma (LLL) problem asks for a deterministic local algorithm solving instances of the Lovász Local Lemma on graphs, where $n$ denotes the relevant in…

Gap conjecture. A bigraph is gapful if and only if it contains a cyclic bigraph.

Let $G$ be a directed graph whose vertices are ordered by a permutation, and let Algorithm be the parallel greedy algorithm that repeatedly identifies vertices with no residual inc…

Let $G$ be a $k$-regular graph with a Hamiltonian cycle $C$. A set of vertices $S\subseteq V(G)$ is required to be independent on $C$ and dominating for $G-C$: if $v$ and $w$ are a…