The Use of S-Functions in Combinatorial Analysis
From MaRDI portal
Publication:5551496
DOI10.4153/CJM-1968-080-xzbMath0165.32802OpenAlexW2315591528MaRDI QIDQ5551496
Publication date: 1968
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1968-080-x
Related Items
Onq-trees, Redfield's papers and their relevance to counting isomers and isomerizations, Combinatorial problems in the theory of music, On multigraphs with a given partition, Unit subduced cycle indices for combinatorial enumeration, Theory and Application of Plane Partitions: Part 1, Theory and Application of Plane Partitions. Part 2, Chromatic uniqueness and equivalence ofK4 homeomorphs, Universality of iterated networks, Manifestations of Polya's counting theorem, Linear and Multilinear Aspects of Isomorph Rejection, Redfield's proofs of MacMahon's conjecture, Symmetric functions and P-recursiveness, On 3-colorings of bipartitep-threshold graphs, Cutpoints and the chromatic polynomial, The number of symmetric nonnegative integral matrices with prescribed row sums, Young diagrams, Schur functions, the Gale-Ryser theorem and a conjecture or Snapper, On the number of cycles of lengthk in a maximal planar graph, A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems, A Formal Calculus for the Enumerative System of Sequences-II. Applications, A Formal Calculus for the Enumerative System of Sequences-III. Further Developments, Binomial Enumeration on Dissects, A note on chromatic uniqueness of graphs, The combinatorial analysis of patterns and the principle of inclusion- exclusion, Classification of chromatically unique graphs having quadratic σ‐polynomials, Counting the 10-point graphs by partition, Quantum field theory meets Hopf algebra, Network reliability and the factoring theorem, Four correspondences between graphs and generalized Young tableaux, Adams operations and \(\lambda\)-operations in \(\beta\)-rings, Chromaticity of two-trees
