SIMPLE PROOF OF THE EXISTENCE OF RESTRICTED RAMSEY GRAPHS BY MEANS OF A PARTITE CONSTRUCTION

被引：25

作者：

NESETRIL, J ^{[1
]}

RODL, V ^{[1
]}

机构：

[1] CZECH TECH UNIV, FJFI, KM, CS-11000 PRAHA 1, CZECHOSLOVAKIA

来源：

COMBINATORICA | 1981年 / 1卷 / 02期

关键词：

D O I：

10.1007/BF02579274

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：199 / 202

页数：4

共 11 条

[1]

DEUBER W, 1975, C MATH SOC J BOLYAI, V0010, P00323

[2]

ERDOS P, 1975, C MATH SOC J BOLYAI, V10, P1127

[3]

ERDOS P, 1975, RECENT ADV GRAPH THE, P183

[4] GRAPHS WITH MONOCHROMATIC COMPLETE SUBGRAPHS IN EVERY EDGE COLORING [J].

FOLKMAN, J .

SIAM JOURNAL ON APPLIED MATHEMATICS, 1970, 18 (01) :19-&

[5] SIMPLE PROOF OF GALVIN-RAMSEY PROPERTY OF CLASS OF ALL FINITE GRAPHS AND A DIMENSION OF A GRAPH [J].

NESETRIL, J ;

RODL, V .

DISCRETE MATHEMATICS, 1978, 23 (01) :49-55

[6] RAMSEY PROPERTY FOR GRAPHS WITH FORBIDDEN COMPLETE SUBGRAPHS [J].

NESETRIL, J ;

RODL, V .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1976, 20 (03) :243-249

[7] SHORT PROOF OF THE EXISTENCE OF HIGHLY CHROMATIC HYPERGRAPHS WITHOUT SHORT CYCLES [J].

NESETRIL, J ;

RODL, V .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1979, 27 (02) :225-227

[8] On a problem of formal logic [J].

Ramsey, FP .

PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 1930, 30 :264-286

[9]

RODL V, 1976, GRAPHS HYPERGRAPHS B, P211

[10]

[No title captured]

← 1 2 →