




















In 1930, Ramsey proved that every infinite graph contains either an infinite clique or an infinite independent set as an induced subgraph. König proved that every infinite graph contains either a ray or a vertex of infinite degree. In this paper, we establish the 2-connected analog of these results.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。