Standard

Coloring cross-intersecting families. / Cherkashin, Danila.

в: Electronic Journal of Combinatorics, Том 25, № 1, #P1.47, 02.03.2018.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Cherkashin, D 2018, 'Coloring cross-intersecting families', Electronic Journal of Combinatorics, Том. 25, № 1, #P1.47.

APA

Cherkashin, D. (2018). Coloring cross-intersecting families. Electronic Journal of Combinatorics, 25(1), [#P1.47].

Vancouver

Cherkashin D. Coloring cross-intersecting families. Electronic Journal of Combinatorics. 2018 Март 2;25(1). #P1.47.

Author

Cherkashin, Danila. / Coloring cross-intersecting families. в: Electronic Journal of Combinatorics. 2018 ; Том 25, № 1.

BibTeX

@article{263793c4a037408a89bc8d4a5b2efd2c,
title = "Coloring cross-intersecting families",
abstract = "Intersecting and cross-intersecting families usually appear in extremal combina- torics in the vein of the Erd{\H o}s-Ko-Rado theorem. On the other hand, P. Erd{\H o}s and L. Lov{\'a}sz 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.",
keywords = "Cross-intersecting family, Hypergraphs colorings, Intersecting family",
author = "Danila Cherkashin",
year = "2018",
month = mar,
day = "2",
language = "English",
volume = "25",
journal = "Electronic Journal of Combinatorics",
issn = "1077-8926",
publisher = "Electronic Journal of Combinatorics",
number = "1",

}

RIS

TY - JOUR

T1 - Coloring cross-intersecting families

AU - Cherkashin, Danila

PY - 2018/3/2

Y1 - 2018/3/2

N2 - Intersecting and cross-intersecting families usually appear in extremal combina- torics in the vein of the Erdős-Ko-Rado theorem. On the other hand, P. Erdős and L. Lovász 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.

AB - Intersecting and cross-intersecting families usually appear in extremal combina- torics in the vein of the Erdős-Ko-Rado theorem. On the other hand, P. Erdős and L. Lovász 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.

KW - Cross-intersecting family

KW - Hypergraphs colorings

KW - Intersecting family

UR - http://www.scopus.com/inward/record.url?scp=85042753536&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85042753536

VL - 25

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

SN - 1077-8926

IS - 1

M1 - #P1.47

ER -

ID: 36097766