\(\Gamma \)-species and the enumeration of \(k\)-trees

zbMath1266.05065arXiv1208.5993MaRDI QIDQ1953357

Andrew Gainer-Dewar

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.5993

zbMATH Keywords

\(k\)-treescombinatorial species

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Group actions on combinatorial structures (05E18)

Related Items (7)

An asymptotic analysis of labeled and unlabeled \(k\)-trees ⋮ Random enriched trees with applications to random graphs ⋮ Limits of random tree-like discrete structures ⋮ Counting unlabeled \(k\)-trees ⋮ On the number of labeled graphs of bounded treewidth ⋮ Graph limits of random unlabelled k-trees ⋮ Graph limits of random graphs from a subset of connected k‐trees

Uses Software

• SageMath

This page was built for publication: \(\Gamma \)-species and the enumeration of \(k\)-trees