Standard

On two-colorings of hypergraphs. / Cherkashin, D. D.; Kulikov, A. B.

In: Doklady Mathematics, Vol. 83, No. 1, 01.02.2011, p. 68-71.

Research output: Contribution to journal › Article › peer-review

Harvard

Cherkashin, DD & Kulikov, AB 2011, 'On two-colorings of hypergraphs', Doklady Mathematics, vol. 83, no. 1, pp. 68-71. https://doi.org/10.1134/S1064562411010157

APA

Cherkashin, D. D., & Kulikov, A. B. (2011). On two-colorings of hypergraphs. Doklady Mathematics, 83(1), 68-71. https://doi.org/10.1134/S1064562411010157

Vancouver

Cherkashin DD, Kulikov AB. On two-colorings of hypergraphs. Doklady Mathematics. 2011 Feb 1;83(1):68-71. https://doi.org/10.1134/S1064562411010157

Author

Cherkashin, D. D. ; Kulikov, A. B. / On two-colorings of hypergraphs. In: Doklady Mathematics. 2011 ; Vol. 83, No. 1. pp. 68-71.

BibTeX

@article{2d11064960ab4a18ae673a9bb0cea1e2,
title = "On two-colorings of hypergraphs",
abstract = "A study was conducted to address a problem arising in the context of the classical problem of P. Erd{\"o}s and A. Hajnal in the extremal hypergraph theory. P. Erd{\"o}s and A. Hajnal revealed that when an n-uniform hypergraph had sufficiently few edges then it had a natural analogue of bipartiteness. It was also revealed that when the hypergraph had many edges then it did not possess property B. An important generalization of property B was property Bk, which was proposed by A.M. Raigorodskii in 2003 and was originally studied by Shabanov. A hypergraph H = (V, E) was said to have property Bk when there existed a red-blue coloring of V such that each edge e ∈ E had at least k red vertices and at least k blue vertices.",
author = "Cherkashin, {D. D.} and Kulikov, {A. B.}",
year = "2011",
month = feb,
day = "1",
doi = "10.1134/S1064562411010157",
language = "English",
volume = "83",
pages = "68--71",
journal = "Doklady Mathematics",
issn = "1064-5624",
publisher = "МАИК {"}Наука/Интерпериодика{"}",
number = "1",

}

RIS

TY - JOUR

T1 - On two-colorings of hypergraphs

AU - Cherkashin, D. D.

AU - Kulikov, A. B.

PY - 2011/2/1

Y1 - 2011/2/1

N2 - A study was conducted to address a problem arising in the context of the classical problem of P. Erdös and A. Hajnal in the extremal hypergraph theory. P. Erdös and A. Hajnal revealed that when an n-uniform hypergraph had sufficiently few edges then it had a natural analogue of bipartiteness. It was also revealed that when the hypergraph had many edges then it did not possess property B. An important generalization of property B was property Bk, which was proposed by A.M. Raigorodskii in 2003 and was originally studied by Shabanov. A hypergraph H = (V, E) was said to have property Bk when there existed a red-blue coloring of V such that each edge e ∈ E had at least k red vertices and at least k blue vertices.

AB - A study was conducted to address a problem arising in the context of the classical problem of P. Erdös and A. Hajnal in the extremal hypergraph theory. P. Erdös and A. Hajnal revealed that when an n-uniform hypergraph had sufficiently few edges then it had a natural analogue of bipartiteness. It was also revealed that when the hypergraph had many edges then it did not possess property B. An important generalization of property B was property Bk, which was proposed by A.M. Raigorodskii in 2003 and was originally studied by Shabanov. A hypergraph H = (V, E) was said to have property Bk when there existed a red-blue coloring of V such that each edge e ∈ E had at least k red vertices and at least k blue vertices.

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

U2 - 10.1134/S1064562411010157

DO - 10.1134/S1064562411010157

M3 - Article

AN - SCOPUS:79953211495

VL - 83

SP - 68

EP - 71

JO - Doklady Mathematics

JF - Doklady Mathematics

SN - 1064-5624

IS - 1

ER -

ID: 36100827