Some remarks on vertex Folkman numbers for hypergraphs

被引：1

作者：

Dudek, Andrzej ^{[1
]}

Ramadurai, Reshma ^{[2
]}

机构：

[1] Western Michigan Univ, Dept Math, Kalamazoo, MI 49008 USA

[2] Masaryk Univ, Fac Informat, Brno, Czech Republic

来源：

DISCRETE MATHEMATICS | 2012年 / 312卷 / 19期

关键词：

Folkman numbers; Hypergraphs; RAMSEY; GRAPHS;

D O I：

10.1016/j.disc.2012.06.014

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Let F(r, G) be the least order of H such that the clique numbers of H and Gate equal and any r-coloring of the vertices of H yields a monochromatic and induced copy of G. The problem of bounding of F(r. G) was studied by several authors and it is well understood. In this note, we extend those results to uniform hypergraphs. (C) 2012 Elsevier B.V. All rights reserved.

引用

页码：2952 / 2957

页数：6

共 17 条

[1] A NOTE ON RAMSEY NUMBERS
AJTAI, M
KOMLOS, J
SZEMEREDI, E
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 1980, 29 (03) : 354 - 360
[2] [Anonymous], 1985, ANNUAIRE U SOFIA FAC
[3] A RAMSEY TYPE PROBLEM CONCERNING VERTEX COLORINGS
BROWN, JI
RODL, V
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1991, 52 (01) : 45 - 52
[4] Conlon D., DISCRETE AP IN PRESS
[5] HYPERGRAPH RAMSEY NUMBERS
Conlon, David
Fox, Jacob
Sudakov, Benny
[J]. JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY, 2010, 23 (01) : 247 - 266
[6] Dudek A., GEN RAMSEY NUM UNPUB
[7] On induced Folkman numbers
Dudek, Andrzej
Ramadurai, Reshma
Roedl, Vojtech
[J]. RANDOM STRUCTURES & ALGORITHMS, 2012, 40 (04) : 493 - 500
[8] An almost quadratic bound on vertex Folkman numbers
Dudek, Andrzej
Rodl, Vojtech
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2010, 100 (02) : 132 - 140
[9] A CANONICAL RAMSEY THEOREM
EATON, N
RODL, V
[J]. RANDOM STRUCTURES & ALGORITHMS, 1992, 3 (04) : 427 - 444
[10] Erdos P., 1975, RECENT ADV GRAPH THE, P183

← 1 2 →