On the asymptotic behavior of the independence number of a random \((n,n)\)-tree

DOI10.1007/BF01858439zbMath0845.05081OpenAlexW2011566902MaRDI QIDQ1911235

Yanyan Li

Publication date: 26 August 1996

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01858439

zbMATH Keywords

randomasymptotic behaviorbipartite treenode independence number

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Analysis of three graph parameters for random trees

Cites Work

• Matchings in random superpositions of bipartite trees
• Asymptotic Methods in Enumeration
• On Representatives of Subsets
• On the expected number of edges in a maximum matching of an (r,s)-tree
• Another Enumeration of Trees
• Some remarks on the theory of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the asymptotic behavior of the independence number of a random \((n,n)\)-tree