Skip to main content
Journal ArticleOPEN ACCESS

The Cycle Lemma and Some Applications

European Journal of Combinatorics (1990) 11(1) 35-40
DOI: 10.1016/S0195-6698(13)80053-4
51Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Two proofs of a frequently rediscovered combinatorial lemma are presented. Using the lemma, a combinatorial proof is given that the average height of an ordered (plane-planted) tree is approximately twice the average node (vertex) level. © 1990, Academic Press Limited. All rights reserved.

Cite

CITATION STYLE

APA

Dershowitz, N., & Zaks, S. (1990). The Cycle Lemma and Some Applications. European Journal of Combinatorics, 11(1), 35–40. https://doi.org/10.1016/S0195-6698(13)80053-4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free