Number of pairs of template matchings in \(q\)-ary tree with randomly marked vertices
type: Item
instance of: scholarly article
title: Number of pairs of template matchings in \(q\)-ary tree with randomly marked vertices
zbMATH Open document ID: 1383.60032
DOI: 10.1007/978-3-319-71504-9_28
author: A. M. Zubkov
author: Vasiliy I. Kruglov
publication date: 2018-02-26T00:00:00Z
Mathematics Subject Classification ID: 60F99
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 60C05
zbMATH DE Number: 6843601
zbMATH Keywords: complete tree
zbMATH Keywords: marked vertices
zbMATH Keywords: sums of dependent indicators
zbMATH Keywords: Poisson approximation
MaRDI profile type: Publication
full work available at URL: 978-3-319-71504-9 28
OpenAlex ID: W2778931635
Recommended article: Enumeration of matchings in complete \(q\)-ary trees
Recommended article: On the number of \(r\)-matchings in a tree
Recommended article: On the number of \(F\)-matchings in a tree
Recommended article: On the number of matchings of a tree
Recommended article: On coincidences of tuples in a \(q\)-ary tree with random labels of vertices
Recommended article: On matching numbers of tree and bipartite degree sequences
Recommended article: A note on the number of matchings and independent sets in trees
Recommended article: The number of maximum matchings in a tree
Recommended article: Matchings in random superpositions of bipartite trees
Recommended article: On coincidences of tuples in a binary tree with random labels of vertices
description: scientific article; zbMATH DE number 6843601