2 problems

Let $M$ be an $n\times n$ matrix with entries in $\{0,1\}$ and row sums $d_1,\dotsc,d_n$. Minc's conjecture. The permanent of $M$ is at most … Minc's conjecture was proved by Brégm…

Let $D$ be a strict graphic sequence of type $\varepsilon$, and let $H_{1}(x)$ be the entropy function whose maximum is attained at $\widetilde{\mathbf{p}}$. Write $\mathbb{G}^{D}$…