A shorter direct proof of that result was obtained by Geelen, Gerards, and Whittle [GGW00p]. However, to prove Theorem 7.0.1, the well-quasi-ordering for graphs of bounded tree-width is needed only ...

Beronika Daxner, Antoine Genitrini, Bernhard Gittenberger, Cécile Mailler, THE RELATION BETWEEN TREE SIZE COMPLEXITY AND PROBABILITY FOR BOOLEAN FUNCTIONS GENERATED BY UNIFORM RANDOM TREES, Applicable ...