On the probability that a random subtree is spanning

DOI10.1002/jgt.22688zbMath1522.05448arXiv1910.07349MaRDI QIDQ6056779

No author found.

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

random graphsconvergence in probabilityspanning treessubtrees

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (4)

Random subtrees and unimodal sequences in graphs ⋮ Solution to a conjecture on the mean subtree order of graphs under edge addition ⋮ Models of random subtrees of a graph ⋮ On the local and global mean orders of sub-\(k\)-trees of \(k\)-trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal results on average subtree density of series-reduced trees
• Monotonicity of the mean order of subtrees
• The average order of a subtree of a tree
• On the average number of nodes in a subtree of a tree
• Generating linear extensions of posets by transpositions
• Pick a Tree – Any Tree
• On the Local and Global Means of Subtree Orders
• Random Trees
• The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
• Subtrees of graphs
• Maximizing the mean subtree order
• Probability: A Graduate Course
• On the mean subtree order of graphs under edge addition

This page was built for publication: On the probability that a random subtree is spanning