Found 1,333 results for "Combinatorics"
by Ronald L. Graham, Martin Grötschel
A graph G consists of a nonempty set V(G) of elements, called vertices or nodes, and a set E(G) of elements called edges...
by Miklós Bóna
The "most orderly" of all n-permutations is obviously the increasing permutation 123 ... n.
by Harris, John M., Jeffry L. Hirst
The Pregolya River passes through a city once known as Konigsberg.
by Symposium in Pure Mathematics University of California, Los Angeles 1968.
by Richard P. Stanley
If F(x) and G(x) are formal power series with G(0) = 0, then we have seen (after Proposition 1.1.9) that the composition...