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 条
12345