Article
Licensed
Unlicensed
Requires Authentication
On regular hypergraphs with high girth and high chromatic number
-
Alina E. Khuzieva
and
Dmitriy A. Shabanov
Published/Copyright:
December 8, 2015
Abstract
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.
Keywords : hypergraph; colouring of hypergraphs; sparse hypergraphs; random recolouring method; girth of a hypergraph
Received: 2015-4-6
Published Online: 2015-12-8
Published in Print: 2015-10-1
© 2015 by Walter de Gruyter Berlin/Boston
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Frontmatter
- On groups of even orders with automorphisms generating recurrent sequences of the maximal period
- Local contractivity of the process of a player rating variation in the Elo model with one adversary
- On regular hypergraphs with high girth and high chromatic number
- On repetitions of long tuples in a Markov chain
- Automorphism-extendable modules
- On read-once transformations of random variables over finite fields
Keywords for this article
hypergraph;
colouring of hypergraphs;
sparse hypergraphs;
random recolouring method;
girth of a hypergraph
Articles in the same Issue
- Frontmatter
- On groups of even orders with automorphisms generating recurrent sequences of the maximal period
- Local contractivity of the process of a player rating variation in the Elo model with one adversary
- On regular hypergraphs with high girth and high chromatic number
- On repetitions of long tuples in a Markov chain
- Automorphism-extendable modules
- On read-once transformations of random variables over finite fields
