• Prolific structures in combinatorial classes 

    Tannock, Murray
    Under what circumstances might every extension of a combinatorial structure contain more copies of another one than the original did? This property, which we call prolificity, holds universally in some cases (e.g., finite ...