Some Examples of Combinatorial Averaging

DOI10.2307/2323644zbMath0579.60008OpenAlexW4249187963MaRDI QIDQ3702190

Herbert S. Wilf

Publication date: 1985

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2323644

zbMATH Keywords

random permutationaveraging problemsnumber of triangles in a random graph

Mathematics Subject Classification ID

Search theory (90B40) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Related Items (5)

On the distribution of comparisons in sorting algorithms ⋮ Efficient bounds on a branch and bound algorithm for graph colouration ⋮ Optimal hierarchy structures for multi-attribute-criteria decisions ⋮ Average case completeness ⋮ Complexity-theoretic models of phase transitions in search problems

This page was built for publication: Some Examples of Combinatorial Averaging