Coloring cross-intersecting families

被引：0

作者：

Cherkashin, Danila ^{[1
,2
,3
]}

机构：

[1] St Petersburg State Univ, Chebyshev Lab, 14th Line VO,29B, St Petersburg 199178, Russia

[2] Moscow Inst Phys & Technol, Lab Adv Combinator & Network Applicat, Inst Sky Lane 9, Dolgoprudnyi 141700, Moscow Region, Russia

[3] Russian Acad Sci, St Petersburg Dept, VA Steklov Inst Math, Moscow, Russia

来源：

ELECTRONIC JOURNAL OF COMBINATORICS | 2018年 / 25卷 / 01期

基金：

俄罗斯科学基金会;

关键词：

KO-RADO THEOREM; SYSTEMS; BOUNDS;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Intersecting and cross-intersecting families usually appear in extremal combinatorics in the vein of the Erdos-Ko-Rado theorem. On the other hand, P. Erdos and L. Lovasz in their noted 1975 paper posed problems on coloring intersecting families as a restriction of classical hypergraph coloring problems to a special class of hypergraphs. This note deals with the mentioned coloring problems stated for cross-intersecting families.

引用

页数：9

共 14 条

[1]

[Anonymous], PREPRINT

[2] An upper bound for the size of a k-uniform intersecting family with covering number k [J].

Arman, Andrii ;

Retter, Troy .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 2017, 147 :18-26

[3]

Cherkashin D., 2011, Moscow J. Comb. Number Theory, V1, P3

[4] A Note on Random Greedy Coloring of Uniform Hypergraphs [J].

Cherkashin, Danila D. ;

Kozik, Jakub .

RANDOM STRUCTURES & ALGORITHMS, 2015, 47 (03) :407-413

[5]

Erdo P., 1975, Infinite and finite sets (Colloq., V11, P609

[6] INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS [J].

ERDOS, P ;

RADO, R ;

KO, C .

QUARTERLY JOURNAL OF MATHEMATICS, 1961, 12 (48) :313-&

[7] ERDOS-KO-RADO THEOREM WITH CONDITIONS ON THE MAXIMAL DEGREE [J].

FRANKL, P .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1987, 46 (02) :252-263

[8] Covers in uniform intersecting families and a counterexample to a conjecture of Lovasz [J].

Frankl, P ;

Ota, K ;

Tokushige, N .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1996, 74 (01) :33-42

[9] TOP-DOWN LOWER BOUNDS FOR DEPTH-3 CIRCUITS [J].

HASTAD, J ;

JUKNA, S ;

PUDLAK, P .

COMPUTATIONAL COMPLEXITY, 1995, 5 (02) :99-112

[10] SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS [J].

HILTON, AJW ;

MILNER, EC .

QUARTERLY JOURNAL OF MATHEMATICS, 1967, 18 (72) :369-&

← 1 2 →