The asymptotic number of spanning forests of complete bipartite labelled graphs

DOI10.1016/j.disc.2012.10.026zbMath1277.05150OpenAlexW2056214077MaRDI QIDQ385398

Dudley Stark

Publication date: 2 December 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.10.026

zbMATH Keywords

random forestrandom treeedge-negative association property

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

Computing the number of \(k\)-component spanning forests of a graph with bounded treewidth ⋮ Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition

Cites Work

• The Enumeration of Point Labelled Chromatic Graphs and Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The asymptotic number of spanning forests of complete bipartite labelled graphs