A simplified construction is presented for Komjáth's result that for every uncountable cardinal $κ$, there are $2^κ$ graphs of size $κ$ none of them being a minor of another.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。