Addendum and erratum to the paper "On the size of a maximal induced tree in a random graph"
Michał Karoński, Zbigniew Palka (1981)
Mathematica Slovaca
Similarity:
Displaying similar documents to “On the size of a maximal induced tree in a random graph”
Addendum and erratum to the paper "On the size of a maximal induced tree in a random graph"
A parametric analysis of the largest induced tree problem in random graphs
M. Protasi, M. Talamo (1986)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Stochastic coalescence.
Aldous, David J. (1998)
Documenta Mathematica
Similarity:
Local extrema in random trees.
Clark, Lane (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Independence number and degree bounded spanning tree.
Rahman, Mohammad Sohel, Kaykobad, Mohammad (2004)
Applied Mathematics E-Notes [electronic only]
Similarity:
Spanning tree congestion of rook's graphs
Kyohei Kozawa, Yota Otachi (2011)
Discussiones Mathematicae Graph Theory
Similarity:
Let G be a connected graph and T be a spanning tree of G. For e ∈ E(T), the congestion of e is the number of edges in G joining the two components of T - e. The congestion of T is the maximum congestion over all edges in T. The spanning tree congestion of G is the minimum congestion over all its spanning trees. In this paper, we determine the spanning tree congestion of the rook's graph Kₘ ☐ Kₙ for any m and n.
Isolated trees in a random graph
Z. Palka (1982)
Applicationes Mathematicae
Similarity:
The lower tail of the random minimum spanning tree.
Flaxman, Abraham D. (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity: