2 problems

Random transference conjecture. Asymptotically almost surely, every spanning subgraph $G'\subseteq G$ satisfying

Packing-minima transference conjecture. For $1\leq j\leq n$,