A Walk Through Combinatorics

DOI10.1142/10258zbMath1361.05001OpenAlexW4253663847MaRDI QIDQ2826588

Miklós Bóna

Publication date: 17 October 2016

Full work available at URL: https://doi.org/10.1142/10258

zbMATH Keywords

permutationscomplexityalgorithmsgenerating functionsgraph theorycombinatorial enumerationplanar graphsposetsRamsey theoryHamiltonian cyclestreesmatchingsdesignspartially ordered setsprobabilistic methodEulerian cyclesinclusion and exclusionpattern avoidanceunlabeled structuresenumeration under group actionlabeled structures

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)

Related Items (7)

Characterisation and classification of signatures of spanning trees of the $n$-cube ⋮ Products of normal subsets ⋮ Invariant synchrony and anti-synchrony subspaces of weighted networks ⋮ Using Catalan words and a \(q\)-shuffle algebra to describe a PBW basis for the positive part of \(U_q(\widehat{\mathfrak{sl}}_2)\) ⋮ A Pascal triangle type calculation for a particular infinite series ⋮ Characteristic power series of graph limits ⋮ Adaptive succinctness

This page was built for publication: A Walk Through Combinatorics