Hypergraphs with high chromatic number

DOI10.1007/BF02582966MaRDI QIDQ1086588zbMATH OpenOpenAlexFDO

Authors Noga Alon

Publication date 1985

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02582966

zbMATH Keywords

chromatic numberk-uniform hypergraphminimal number of edgesTurán number

Mathematics Subject Classification ID

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

Recommendations

• Constructions of sparse uniform hypergraphs with high chromatic number
• On r-chromatic hypergraphs
• Regular behavior of the maximal hypergraph chromatic number
• The Erdős-Hajnal problem of hypergraph colouring, its generalizations, and related problems
• A contribution to the chromatic theory of uniform hypergraphs

Cites work

• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• Lower bounds for Turán's problem
• On 3-chromatic hypergraphs
• On a combinatorial problem. II
• On a property of families of sets

Cited in

(27)

• On the chromatic number of finite systems of subsets
• Graph properties and hypergraph colourings
• Acyclic subgraphs with high chromatic number
• Chromatic numbers of algebraic hypergraphs
• On the Erdős-Hajnal problem for 3-graphs
• On the chromatic number of set systems
• On the problem of Erdős and Hajnal in the case of list colorings
• Conflict-free colourings of uniform hypergraphs with few edges
• Coloring H-free hypergraphs
• Constructions of sparse uniform hypergraphs with high chromatic number
• On proper colourings of hypergraphs using prescribed colours
• Random coloring method in the combinatorial problem of Erdős and Lovász
• On splittable colorings of graphs and hypergraphs
• Regular behavior of the maximal hypergraph chromatic number
• scientific article; zbMATH DE number 3898934 (Why is no real title available?)
• ON HYPERGRAPH COLOURINGS
• scientific article; zbMATH DE number 3708458 (Why is no real title available?)
• Dense uniform hypergraphs have high list chromatic number
• A general framework for hypergraph coloring
• Extremal problems in hypergraph colourings
• Minors in Graphs with High Chromatic Number
• Colorings of hypergraphs with large number of colors
• Colorings of hypergraphs with large number of colors
• On r-chromatic hypergraphs
• Note on polychromatic coloring of hereditary hypergraph families
• Improvement of the lower bound in the Erdös-Hajnal combinatorial problem
• Coloring non-uniform hypergraphs without short cycles

This page was built for publication: Hypergraphs with high chromatic number

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