The probability that a random graph is even-decomposable

Oliver Janzer, Fredy Yip

A graph $G$ with an even number of edges is called even-decomposable if there is a sequence $V(G)=V_0\supset V_1\supset \cdots \supset V_k=\varnothing$ such that for each $i$, $G[V_i]…