2 problems

Let $G$ be a generalized split graph, a chordal graph, or a co-chordal graph, and consider Algorithm with the look-ahead requirement removed. Look-ahead-free rounding conjecture. T…

Let $p$ be prime, let $G_p$ be the Paley graph, let $g$ be a multiplicative generator of $\mathbb F_p^\times$, and let $\vartheta$ denote the Lovász theta function. Improvement con…