Catherine Babecki

When is the graph of a random 0/1 polytope a clique?

We study graph‐theoretic properties of random 0/1$0/1$ polytopes. Specifically, let Qpn⊆{0,1}n$Q_p^n \subseteq \lbrace 0,1\rbrace ^n$ be a random subset where each point is included independently with probability p$p$ , and consider the graph Gp$G_p$ of the polytope conv(Qpn)$\operatorname{conv}(Q_p^n)$ . We provide a...