Hypergraphs with high chromatic number

DOI10.1007/BF02582966zbMath0609.05054OpenAlexW2069521936MaRDI QIDQ1086588

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 numberTurán numberk-uniform hypergraphminimal number of edges

Mathematics Subject Classification ID

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

Related Items (18)

Conflict-Free Colourings of Uniform Hypergraphs With Few Edges ⋮ A General Framework for Hypergraph Coloring ⋮ Extremal problems in hypergraph colourings ⋮ Colorings of hypergraphs with large number of colors ⋮ Colorings of hypergraphs with large number of colors ⋮ On \(r\)-chromatic hypergraphs ⋮ Regular Behavior of the Maximal Hypergraph Chromatic Number ⋮ On the chromatic number of set systems ⋮ Coloring H-free hypergraphs ⋮ Constructions of sparse uniform hypergraphs with high chromatic number ⋮ On proper colourings of hypergraphs using prescribed colours ⋮ On the Erdős-Hajnal problem for 3-graphs ⋮ Improvement of the lower bound in the Erdös-Hajnal combinatorial problem ⋮ Coloring non-uniform hypergraphs without short cycles ⋮ On the chromatic number of finite systems of subsets ⋮ Random coloring method in the combinatorial problem of Erdős and Lovász ⋮ On the Problem of Erdős and Hajnal in the Case of List Colorings ⋮ On splittable colorings of graphs and hypergraphs

Cites Work

• Unnamed Item
• Lower bounds for Turán's problem
• On 3-chromatic hypergraphs
• On a property of families of sets
• On a combinatorial problem. II

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