Hypergraphs and a functional equation of Bouwkamp and de Bruijn

DOI10.1016/j.jcta.2004.11.002zbMath1064.05106arXivmath/0410373OpenAlexW1978124198MaRDI QIDQ556860

Louis H. Kalikow, Ira M. Gessel

Publication date: 23 June 2005

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

exponential generating functionshypertrees

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Hypergraphs (05C65)

Related Items (5)

Plurigraph coloring and scheduling problems ⋮ Generating functions and counting formulas for spanning trees and forests in hypergraphs ⋮ Chromatic symmetric functions of hypertrees ⋮ Phase transition of random non-uniform hypergraphs ⋮ \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs

Cites Work

• Counting complements in the partition lattice, and hypertrees
• Cayley's formula for multidimensional trees
• A note on the asymptotic normality of the distribution of the number of empty cells in occupancy problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hypergraphs and a functional equation of Bouwkamp and de Bruijn