On regular hypergraphs with high girth and high chromatic number

DOI10.1515/DMA-2015-0027zbMATH Open1345.05070OpenAlexW2565885582MaRDI QIDQ314149FDOQ314149

Authors: Alina E. Khuzieva, D. 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

Recommendations

• Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number
• On coloring uniform hypergraphs without 3-cycles
• On colorings of non-uniform hypergraphs without short cycles
• Chromatic numbers and homomorphisms of large girth hypergraphs
• Constructions of sparse uniform hypergraphs with high chromatic number

zbMATH Keywords

hypergraphcolouring of hypergraphsgirth of a hypergraphrandom recolouring methodsparse hypergraphs

Mathematics Subject Classification ID

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

Cited In (6)

• Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number
• A note on generalized chromatic number and generalized girth
• Chromatic numbers and homomorphisms of large girth hypergraphs
• On some generalizations of the property B problem of an \(n\)-uniform hypergraph
• Random constructions of hypergraphs with large girth and without panchromatic colorings
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314149)