A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory

By Miklós Bóna. 2006

75 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Aitchison’s Compositional Data Analysis 40 Years on: A Reappraisal (2022, background): “The number of DAGs possible for a D-component composition is the Cayley number DD−2 [10], equal to 125 for D = 5, but increasing more than exponentially as D increases.”
Variable Selection in Compositional Data Analysis Using Pairwise Logratios (2018, background): “From graph theory, the number of acyclic connected graphs of m elements is known—it is the Cayley number, equal to mm−2 (Bóna 2006), which, in the archaeometric data set, is another huge number: 119 2,357,947,691, over 2 billion (note that the edges are not ranked in this counting, just like the…”