Regular Behavior of the Maximal Hypergraph Chromatic Number

DOI10.1137/19M1281861zbMath1444.05055arXiv1808.01482OpenAlexW3034387541MaRDI QIDQ3300758

Danila Cherkashin, Fedor Petrov

Publication date: 30 July 2020

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.01482

zbMATH Keywords

subadditivityhypergraph coloringErdős-Hajnal problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Erdős-Hajnal problem for \(H\)-free hypergraphs ⋮ Estimate of the number of edges in subgraphs of a Johnson graph ⋮ On the Erdős-Hajnal problem for 3-graphs

Cites Work

• Unnamed Item
• Hypergraphs with high chromatic number
• What we know and what we do not know about Turán numbers
• On the chromatic number of set systems
• Greedy colorings of uniform hypergraphs
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• Extremal problems in hypergraph colourings
• Probability and Computing
• Colorings of hypergraphs with large number of colors

This page was built for publication: Regular Behavior of the Maximal Hypergraph Chromatic Number