On the probability of occurence of labelled subtrees of a randomly labelled tree

DOI10.1016/0304-3975(89)90040-6zbMath0734.05043OpenAlexW2031347916MaRDI QIDQ810523

F. Michel Dekking

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90040-6

zbMATH Keywords

binary treerandom graph

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

Embedding binary sequences into Bernoulli site percolation on \(\mathbb{Z}^3\) ⋮ Harry Kesten's work in probability theory ⋮ Percolation of words on the hypercubic lattice with one-dimensional long-range interactions

Cites Work

• Connectivity properties of Mandelbrot's percolation process
• Superbranching processes and projections of random Cantor sets
• Subcritical branching processes in a two-state random environment, and a percolation problem on trees

This page was built for publication: On the probability of occurence of labelled subtrees of a randomly labelled tree