The following pages link to Forests of labeled trees (Q5540276):
Displayed 21 items.
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages (Q443735) (← links)
- Cutting down trees with a Markov chainsaw (Q473156) (← links)
- A recursive algorithm for trees and forests (Q507491) (← links)
- A new bijection on rooted forests (Q686461) (← links)
- Counting forests (Q750454) (← links)
- Trees, forests, and total positivity. I: \(q\)-trees and \(q\)-forests matrices (Q820844) (← links)
- On Cayley's formula for counting forests (Q912847) (← links)
- A logical approach to asymptotic combinatorics I. First order properties (Q1103939) (← links)
- Coalescent random forests (Q1284161) (← links)
- A bijective proof of the Shor recurrence (Q1746570) (← links)
- Exceptional sequences and idempotent functions (Q1983234) (← links)
- A remark on the enumeration of rooted labeled trees (Q2182187) (← links)
- Mappings of acyclic and parking functions (Q2264668) (← links)
- Ballots and rooks (Q2561226) (← links)
- Total positivity of some polynomial matrices that enumerate labeled trees and forests. I: Forests of rooted labeled trees (Q2684476) (← links)
- A new combinatorial representation of the additive coalescent (Q4633321) (← links)
- The structure of elements in finite full transformation semigroups (Q4654252) (← links)
- Sums of r-Lah numbers and r-Lah polynomials (Q4988849) (← links)
- Preuves combinatoires des identites d'Abel (Q5906930) (← links)
- Preuves combinatoires des identites d'Abel (Q5967091) (← links)
- From Abel’s Binomial Theorem to Cayley’s Tree Formula (Q6189660) (← links)