Unavoidable induced subgraphs of infinite 2-connected graphs

IF 0.7 3区数学 Q2 MATHEMATICS Discrete Mathematics Pub Date : 2024-12-04 DOI:10.1016/j.disc.2024.114346

Sarah Allred , Guoli Ding , Bogdan Oporowski

引用次数: 0

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.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

求助全文

约1分钟内获得全文去求助

来源期刊

Discrete Mathematics 数学-数学

CiteScore

1.50

自引率

12.50%

发文量

424

审稿时长

6 months

期刊介绍： Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.

期刊最新文献

On the nontrivial extremal eigenvalues of graphs Editorial Board A spanning tree with at most k leaves in a K1,5-free graph On the saturation spectrum of the unions of disjoint cycles Multigraph edge-coloring with local list sizes