Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number

DOI10.1134/S0001434615110346zbMath1409.05143OpenAlexW2268400723MaRDI QIDQ268128

Dmitriy A. Shabanov, Alina E. Khuzieva

Publication date: 14 April 2016

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434615110346

zbMATH Keywords

hypergraphchromatic numbergirthcoloring of \(n\)-uniform hypergraphheavy edgelight edgeminimum number of hypergraph edges

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) 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

Cites Work

• Unnamed Item
• Coloring uniform hypergraphs with few edges
• Constructions of sparse uniform hypergraphs with high chromatic number
• On the existence of regular n-graphs with given girth

This page was built for publication: Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number