Probabilistic methods
From MaRDI portal
Publication:1091406
DOI10.1007/BF02582964zbMath0623.05047OpenAlexW2915030152MaRDI QIDQ1091406
Publication date: 1985
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02582964
Random graphs (graph-theoretic aspects) (05C80) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Permutations, words, matrices (05A05) Combinatorial probability (60C05)
Related Items (4)
On explicit random-like tournaments ⋮ On codes with the identifiable parent property ⋮ A constructive solution to a problem of ranking tournaments ⋮ Perfect hash families: Probabilistic methods and explicit constructions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the maximum cardinality of a consistent set of arcs in a random tournament
- A note on the independence number of triangle-free graphs
- On a packing and covering problem
- Near perfect coverings in graphs and hypergraphs
- On 3-chromatic hypergraphs
- On some combinatorial questions in finite-dimensional spaces
- ``Integer-making theorems
- A dense infinite Sidon sequence
- Extremal uncrowded hypergraphs
- Asymptotic lower bounds for Ramsey functions
- Balancing families of sets
- An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
- Graph Theory and Probability
- Graph Theory and Probability. II
- Six Standard Deviations Suffice
- On a Problem of Schütte and Erdös
- On Sets of Consistent Arcs in a Tournament
- On a combinatorial conjecture of Erdös
- On a combinatorial problem. II
- A Constructive Solution to a Tournament Problem
- On a Problem in Graph Theory
- Some remarks on the theory of graphs
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
This page was built for publication: Probabilistic methods
