Probabilistic methods

DOI10.1007/BF02582964MaRDI QIDQ1091406zbMATH OpenOpenAlexFDO

Authors Joel Spencer

Publication date 1985

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

random coloringsrandom configurationsrandom graphs

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Permutations, words, matrices (05A05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Review text

Various illustrations are given of how probabilistic methods can be used for proving the existence of combinatorial configurations having certain desired properties.

Cites work

• ``Integer-making theorems
• A Constructive Solution to a Tournament Problem
• A dense infinite Sidon sequence
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A note on the independence number of triangle-free graphs
• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• Asymptotic lower bounds for Ramsey functions
• Balancing families of sets
• Extremal uncrowded hypergraphs
• Graph Theory and Probability
• Graph Theory and Probability. II
• scientific article; zbMATH DE number 3482343 (Why is no real title available?)
• scientific article; zbMATH DE number 3492718 (Why is no real title available?)
• scientific article; zbMATH DE number 3632478 (Why is no real title available?)
• scientific article; zbMATH DE number 3188524 (Why is no real title available?)
• scientific article; zbMATH DE number 3198027 (Why is no real title available?)
• Near perfect coverings in graphs and hypergraphs
• On 3-chromatic hypergraphs
• On a combinatorial conjecture of Erdös
• On a combinatorial problem. II
• On a packing and covering problem
• On a Problem in Graph Theory
• On a Problem of Schütte and Erdös
• On Sets of Consistent Arcs in a Tournament
• On some combinatorial questions in finite-dimensional spaces
• On the maximum cardinality of a consistent set of arcs in a random tournament
• Six Standard Deviations Suffice
• Some remarks on the theory of graphs

Cited in

(6)

• On codes with the identifiable parent property
• Perfect hash families: Probabilistic methods and explicit constructions
• On explicit random-like tournaments
• A constructive solution to a problem of ranking tournaments
• scientific article; zbMATH DE number 1439074 (Why is no real title available?)
• scientific article; zbMATH DE number 3266174 (Why is no real title available?)

This page was built for publication: Probabilistic methods

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