3 problems

Let $G$ be a bipartite graph with vertex classes $A$ and $B$, each of size $n$. The maximum degree of $G$ is at most $\varepsilon n$, and an induced four cycle-free subgraph is an…

Let $M$ be an $m\times n$ binary matrix, with entries in $\{0,1\}$, and let $\gamma_2(M)$ denote its factorization max-norm. A submatrix is obtained by restricting $M$ to selected…

Let $M$ be a Boolean matrix, meaning a matrix with entries in $\{0,1\}$. Its factorization max-norm is denoted by $\gamma_2(M)$, and let $\operatorname{bl}(M)$ be the minimum numbe…