scientific article; zbMATH DE number 4101220

MaRDI QIDQ3826580zbMATH OpenFDO

Authors

Publication date 1984

zbMATH Keywords

chromatic number of a graphgraph coloringhypergeometric distributionsrandom graphstails of the binomial and the

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• scientific article; zbMATH DE number 981678
• scientific article; zbMATH DE number 3450155
• Paul Erdős and probabilistic reasoning
• scientific article; zbMATH DE number 3482343
• scientific article; zbMATH DE number 742946

Cited in

(13)

• A probabilistic algorithm for vertex connectivity of graphs
• Optimal bounds for the predecessor problem and related problems
• Probabilistic pursuits on graphs
• Sieve methods in random graph theory
• On complexity of optimal recombination for flowshop scheduling problems
• Graph Theory and Probability. II
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• scientific article; zbMATH DE number 3961650 (Why is no real title available?)
• Probabilistic construction of proportional graphs
• scientific article; zbMATH DE number 1245629 (Why is no real title available?)
• Methodology for Stochastic Graph Completion-Time Problems
• On solving travelling salesman problem with vertex requisitions
• Paul Erdős and probabilistic reasoning

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 Q3826580)