Large bounded degree trees in expanding graphs.
Balogh, József, Csaba, Béla, Pei, Martin, Samotij, Wojciech (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Large trees in random graphs”
Large bounded degree trees in expanding graphs.
Induced trees in triangle-free graphs.
Matousek, Jirí, Sámal, Robert (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the size of a maximal induced tree in a random graph
Michał Karoński, Zbigniew Palka (1980)
Mathematica Slovaca
Similarity:
The number of -matchings in almost every tree is a zero residue.
Alon, Noga, Haber, Simi, Krivelevich, Michael (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Asymptotic growth of Markoff-Hurwitz numbers
Arthur Baragar (1994)
Compositio Mathematica
Similarity:
More About Singular Line Graphs of Trees
M. C. Marino, I. Sciriha, S. K. Simić, D. V. Tošić (2006)
Publications de l'Institut Mathématique
Similarity:
Collective tree spanners and routing in AT-free related graphs.
Dragan, Feodor F., Yan, Chenyu, Corneil, Derek G. (2006)
Journal of Graph Algorithms and Applications
Similarity: