On critical 3-chromatic hypergraphs

DOI10.1007/BF01895846zbMATH Open0374.05028OpenAlexW2146531031MaRDI QIDQ4152563FDOQ4152563

Authors: Vladimír Müller, Vojtěch Rödl, Daniel Turzík 

Publication date: 1977

Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Cites Work

• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• A general framework for hypergraph coloring
• A surprising permanence of old motivations (a not-so-rigid story)
• The enumeration problem for color critical linear hypergraphs

This page was built for publication: On critical 3-chromatic hypergraphs

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