On the asymptotic behavior of the independence number of a random \((n,n)\)-tree
Let \(T\) denote a bipartite tree with \(n\) labelled dark nodes and \(n\) labelled light nodes. The authors show that the node independence number of \(T\) lies between \(n\) and \((1.27974)n\) for almost all such trees \(T\) as \(n \to \infty\).
scientific article; zbMATH DE number 867721
scientific article