加载中…
For a graph let denote the supremum of taken over all non-null graphs not containing as a minor. We show that when is a union of cycles, verifying conjectures of Reed and Wood, and Harvey and Wood. We derive the above result from a theorem which allows us to find two vertex disjoint subgraphs with prescribed densities in a sufficiently dense graph, which might be of independent interest.

生成讲解博客的中文版本

生成AI智能校验的中文版本