scientific article; zbMATH DE number 742946

zbMATH Open0814.05010MaRDI QIDQ4763387FDOQ4763387

Authors: Joel Spencer 

Publication date: 11 April 1995

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

coloringsprobabilistic method

Mathematics Subject Classification ID

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

Cited In (7)

• From Erdős to algorithms
• Title not available (Why is that?)
• Hypergraph colouring and the Lovász local lemma
• On the minimal number of edges in color-critical graphs
• The concentration of the chromatic number of random graphs
• The extended dominating sets in graphs
• Title not available (Why is that?)

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)