On regular hypergraphs with high girth and high chromatic number

DOI10.1515/DMA-2015-0027zbMath1345.05070OpenAlexW2565885582MaRDI QIDQ314149

Alina E. Khuzieva, Dmitriy A. Shabanov

Publication date: 13 September 2016

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2015-0027

zbMATH Keywords

hypergraphcolouring of hypergraphsgirth of a hypergraphrandom recolouring methodsparse hypergraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

On some generalizations of the property B problem of an \(n\)-uniform hypergraph ⋮ Random constructions of hypergraphs with large girth and without panchromatic colorings

This page was built for publication: On regular hypergraphs with high girth and high chromatic number