On general two-colorings of uniform hypergraphs

被引:0
|
作者
A. P. Rozovskaya
机构
[1] Moscow State University,
来源
Doklady Mathematics | 2009年 / 80卷
关键词
Extremal Problem; DOKLADY Mathematic; Common Vertex; Probabilistic Argument; Hereditary Property;
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
页码:837 / 839
页数:2
相关论文
共 50 条
  • [1] On general two-colorings of uniform hypergraphs
    Rozovskaya, A. P.
    [J]. DOKLADY MATHEMATICS, 2009, 80 (03) : 837 - 839
  • [2] Equitable two-colorings of uniform hypergraphs
    Shabanov, Dmitry A.
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2015, 43 : 185 - 203
  • [3] On two-colorings of hypergraphs
    D. D. Cherkashin
    A. B. Kulikov
    [J]. Doklady Mathematics, 2011, 83 : 68 - 71
  • [4] On two-colorings of hypergraphs
    Cherkashin, D. D.
    Kulikov, A. B.
    [J]. DOKLADY MATHEMATICS, 2011, 83 (01) : 68 - 71
  • [5] On Algorithmic Methods of Analysis of Two-Colorings of Hypergraphs
    Lebedeva A.V.
    [J]. Journal of Mathematical Sciences, 2016, 213 (2) : 211 - 229
  • [6] TWO-COLORINGS OF A RANDOM HYPERGRAPH
    Semenov, A. S.
    [J]. THEORY OF PROBABILITY AND ITS APPLICATIONS, 2019, 64 (01) : 59 - 77
  • [7] Colorings versus list colorings of uniform hypergraphs
    Wang, Wei
    Qian, Jianguo
    Yan, Zhidan
    [J]. JOURNAL OF GRAPH THEORY, 2020, 95 (03) : 384 - 397
  • [8] Greedy Colorings of Uniform Hypergraphs
    Pluhar, Andras
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2009, 35 (02) : 216 - 221
  • [9] 2-Colorings of uniform hypergraphs
    Demidovich, Yu. A.
    Raigorodskii, A. M.
    [J]. MATHEMATICAL NOTES, 2016, 100 (3-4) : 629 - 632
  • [10] Colorings of uniform hypergraphs with large girth
    A. B. Kupavskii
    D. A. Shabanov
    [J]. Doklady Mathematics, 2012, 85 : 247 - 250