Unavoidable induced subgraphs of infinite 2-connected graphs

Document Type

Article

Publication Date

4-1-2025

Abstract

In 1930, Ramsey proved that every infinite graph contains either an infinite clique or an infinite independent set. König proved that every connected infinite graph contains either a ray or a vertex of infinite degree. In this paper, we establish the 2-connected analog of these results.

Publication Source (Journal or Book title)

Discrete Mathematics

This document is currently not available here.

Share

COinS