RAMSEY THEORY FOR HIGHLY CONNECTED MONOCHROMATIC SUBGRAPHS

被引：6

作者：

Bergfalk, J. ^{[1
]}

Hrusak, M. ^{[1
]}

Shelah, S. ^{[2
,3
]}

机构：

[1] Univ Nacl Autonoma Mexico, Ctr Ciencias Matemat, Campus Morelia, Morelia 58089, Michoacan, Mexico

[2] Hebrew Univ Jerusalem, Einstein Inst Math, Edmond J Safra Campus, IL-91904 Jerusalem, Israel

[3] Rutgers State Univ, Dept Math, Hill Ctr, Busch Campus,110 Frelinghuysen Rd, Piscataway, NJ 08854 USA

来源：

ACTA MATHEMATICA HUNGARICA | 2021年 / 163卷 / 01期

关键词：

Ramsey theory; k-connected graph; highly connected graph; Mahlo; cardinal; weakly compact cardinal;

D O I：

10.1007/s10474-020-01058-x

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

An infinite graph is highly connected if the complement of any subgraph of smaller size is connected. We consider weaker versions of Ramsey's Theorem asserting that in any coloring of the edges of a complete graph there exist large highly connected subgraphs all of whose edges are colored by the same color.

引用

页码：309 / 322

页数：14

共 20 条

[1] Decompositions of edge-colored infinite complete graphs into monochromatic paths [J].

Elekes, Marton ;

Soukup, Daniel T. ;

Soukup, Lajos ;

Szentmiklossy, Zoltan .

DISCRETE MATHEMATICS, 2017, 340 (08) :2053-2069

[2]

Erds P., 1943, B AM MATH SOC, V49

[3]

Erds P., 1984, COMBINATORIAL SET TH

[4]

Erds P., 1956, B AM MATH SOC, V56

[5]

Graham R., 1980, Ramsey Theory

[6]

Hajnal A., 1987, C MATH SOC, V52

[7]

Harrington L., 1985, NOTRE DAME J FORMAL, V26

[8]

Jensen R. B., 1972, ANN MATH LOGIC, V4

[9]

Kanamori A., 1994, PERSPECTIVES MATH LO

[10]

Komjath P., 2018, ACTA MATH HUNGAR, V154

← 1 2 →