Forests of labeled trees

DOI10.1016/S0021-9800(68)80033-XMaRDI QIDQ5540276zbMATH OpenOpenAlexFDO

Authors John Riordan

Publication date 1968

Published in Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0021-9800(68)80033-x

zbMATH Keywords

topology

Cited in

(22)

• A logical approach to asymptotic combinatorics I. First order properties
• Coalescent random forests
• A bijective proof of the Shor recurrence
• Exceptional sequences and idempotent functions
• A remark on the enumeration of rooted labeled trees
• Mappings of acyclic and parking functions
• Ballots and rooks
• Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees
• Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
• A new combinatorial representation of the additive coalescent
• The structure of elements in finite full transformation semigroups
• Cutting down trees with a Markov chainsaw
• Sums of r-Lah numbers and r-Lah polynomials
• A recursive algorithm for trees and forests
• Preuves combinatoires des identites d'Abel
• Preuves combinatoires des identites d'Abel
• From Abel’s Binomial Theorem to Cayley’s Tree Formula
• A Telescopic Proof of Cayley’s Formula
• A new bijection on rooted forests
• Counting forests
• Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices
• On Cayley's formula for counting forests

This page was built for publication: Forests of labeled trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5540276)