Let r, s and t be integers and let c(r) be such that every graph G with at least c(r)|G| edges has a Kr minor. We prove that there is a function fr,s,t(n), with fr,s,t(n)=o(n) as n→∞, such that every graph of order n and having at least (c(r)+s?1)n+fr,s,t(n) edges contains either t disjoint Kr minors or a Ks,t minor.
展开▼
机译：令r，s和t为整数，令c（r）使得每个图G至少具有c（r）| G |。边缘有一个Kr小调。我们证明存在一个函数fr，s，t（n），其中fr，s，t（n）= o（n）为n→∞，使得n阶的每个图至少具有（c（r ）+ s？1）n + fr，s，t（n）边包含t个不相交的Kr次要或Ks，t次要。
展开▼
