On regular hypergraphs with high girth and high chromatic number

被引：0
|
作者：
Khuzieva, Alina E. [1 ]
Shabanov, Dmitriy A. [2 ]
机构：
[1] State Univ, Moscow Inst Phys & Technol, Moscow, Russia
[2] Moscow MV Lomonosov State Univ, Moscow 117234, Russia
来源：
DISCRETE MATHEMATICS AND APPLICATIONS | 2015年 / 25卷 / 05期
关键词：
hypergraph; colouring of hypergraphs; sparse hypergraphs; random recolouring method; girth of a hypergraph;
D O I：
10.1515/dma-2015-0027
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The paper is concerned with an extremal problem of combinatorial analysis on finding the minimal possible number of edges in an n-regular hypergraph with chromatic number greater than r and girth greater than s. A new lower estimate of this extremal value is obtained and a number of related results is proved.
引用
收藏
页码：277 / 294
页数：18
相关论文
共 50 条
  • [1] On regular hypergraphs of high girth
    Ellis, David
    Linial, Nathan
    ELECTRONIC JOURNAL OF COMBINATORICS, 2014, 21 (01):
  • [2] Chromatic-Choosability of Hypergraphs with High Chromatic Number
    Wang, Wei
    Qian, Jianguo
    ELECTRONIC JOURNAL OF COMBINATORICS, 2019, 26 (01):
  • [3] ON THE CHROMATIC NUMBER OF RANDOM REGULAR HYPERGRAPHS
    Bennett, Patrick
    Frieze, Alan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2024, 38 (02) : 1369 - 1380
  • [4] Another simple proof of the high girth, high chromatic number theorem
    Marshall, Simon
    AMERICAN MATHEMATICAL MONTHLY, 2008, 115 (01): : 68 - 70
  • [5] Constructions of Sparse Uniform Hypergraphs With High Chromatic Number
    Kostochka, A. V.
    Rodl, V.
    RANDOM STRUCTURES & ALGORITHMS, 2010, 36 (01) : 46 - 56
  • [6] Quantitative Estimates of Characteristics for Hypergraphs of Large Girth and Large Chromatic Number
    Khuzieva, A. E.
    Shabanov, D. A.
    MATHEMATICAL NOTES, 2015, 98 (5-6) : 995 - 998
  • [7] Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number
    A. É. Khuzieva
    D. A. Shabanov
    Mathematical Notes, 2015, 98 : 995 - 998
  • [8] Dense uniform hypergraphs have high list chromatic number
    Alon, Noga
    Kostochka, Alexandr
    DISCRETE MATHEMATICS, 2012, 312 (14) : 2119 - 2125
  • [9] Almost all graphs with high girth and suitable density have high chromatic number
    Osthus, D
    Prömel, HJ
    Taraz, A
    JOURNAL OF GRAPH THEORY, 2001, 37 (04) : 220 - 226
  • [10] The total chromatic number of regular graphs of high degree
    XIE DeZheng YANG WanNian College of Mathematics and Physics Chongqing University Chongqing China
    ScienceinChina(SeriesA:Mathematics), 2009, 52 (08) : 1743 - 1759
12345