The asymptotic number of spanning forests of complete bipartite labelled graphs

DOI10.1016/J.DISC.2012.10.026zbMATH Open1277.05150OpenAlexW2056214077MaRDI QIDQ385398FDOQ385398

Authors: 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Enumeration of Point Labelled Chromatic Graphs and Trees
• Title not available (Why is that?)
• Enumeration for spanning forests of complete bipartite graphs.

Cited In (3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385398)