Recommendations
Cites work
- scientific article; zbMATH DE number 3188524 (Why is no real title available?)
- scientific article; zbMATH DE number 3195967 (Why is no real title available?)
- A Note on a Combinatorial Problem of ErdŐS and Hajnal
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
- Coloring n-sets red and blue
- Colour-critical graphs and hypergraphs
- Ein kombinatorisches Problem von P. Erdős und A. Hajnal
- ON THE TWO-COLOURING OF HYPERGRAPHS
- On 3-chromatic hypergraphs
- On A Combinatorial Problem III
- On A Combinatorial Problem of Erdös
- On Property B of Families of Sets
- On a Combinatorial Problem of Erdös and Hajnal
- On a combinatorial problem. II
- On chromatic number of graphs and set-systems
- On property B and on Steiner systems
- The enumeration problem for color critical linear hypergraphs
- The existence problem for colour critical linear hypergraphs
Cited in
(7)- Color-critical graphs and hypergraphs with few edges: a survey
- Color-critical graphs and hypergraphs with few edges and no short cycles
- The local cut lemma
- On the chromaticity of quasi linear hypergraphs
- On the number of edges in hypergraphs critical with respect to strong colourings
- Sparse \(H\)-colourable graphs of bounded maximum degree
- Restricted extension of sparse partial edge colorings of hypercubes
This page was built for publication: Sparse colour-critical hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809089)
