Keywords
- Random Walk
- Directed Path
- Uniform Flow
- Maximal Rank
- Empty Sequence
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Henry H. Crapo and Gian-Carlo Rota, On the foundation of Combinatorial theory: Combinatorial Geometries, M.I.T. 1968.
G. Birkhoff, Lattice Theory, Amer. Math. Soc. Coll. Publ.
David A. Klarner, The number of graded partially ordered sets, Journal of Combinatorial Theory 6 (1969) p. 12–19.
L. Harper and G. C. Rota, Matching theory; an introduction. M.I.T.
Kirby A. Baker, A generalization of Sperner's Lemma, Journal of Comninatorial Theory 6 (1969) p. 224–225.
A. Feinstein, Foundations of information theory, McGraw-Hill, 1958.
D. Lubell, A short proof of Sperner's Lemma, Journal of Combinatorial Theory 1 (1966) p. 299.
A. Rényi, Lectures on the theory of search, University of North Carolina at Chapel Hill, Institute of Statistics Mimeo Series No. 600.7, May 1969.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1973 Springer-Verlag
About this paper
Cite this paper
Rényi, A. (1973). Uniform flows in cascade graphs. In: Behara, M., Krickeberg, K., Wolfowitz, J. (eds) Probability and Information Theory II. Lecture Notes in Mathematics, vol 296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0059818
Download citation
DOI: https://doi.org/10.1007/BFb0059818
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06211-0
Online ISBN: 978-3-540-38485-4
eBook Packages: Springer Book Archive
