scientific article; zbMATH DE number 742946

MaRDI QIDQ4763387zbMATH OpenFDO

Authors Joel Spencer

Publication date 11 April 1995

zbMATH Keywords

coloringsprobabilistic method

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Combinatorial probability (60C05) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) 2-person games (91A05)

Recommendations

• From Erdős to algorithms
• scientific article; zbMATH DE number 3989350
• scientific article; zbMATH DE number 53883
• scientific article; zbMATH DE number 863502
• scientific article; zbMATH DE number 782056

Cited in

(7)

• On the minimal number of edges in color-critical graphs
• The concentration of the chromatic number of random graphs
• From Erdős to algorithms
• Hypergraph colouring and the Lovász local lemma
• scientific article; zbMATH DE number 3989350 (Why is no real title available?)
• scientific article; zbMATH DE number 4101220 (Why is no real title available?)
• The extended dominating sets in graphs

This page was built for publication:

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