Author:
Friedman Limor,Krivelevich Michael
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference28 articles.
1. N. Alon: Eigenvalues and expanders, Combinatorial 6 (1986), 83–96.
2. N. ALon and N. Linial: Cycles of length 0 modulo k in directed graphs, Journal of Combinatorial Theory, Ser. B 47 (1989), 114–119.
3. N. Alon and J. H. Spencer: The Probabilistic Method, 4th edition, Wiley, New York, 2015.
4. J. Balogh, B. CSABA, M. Pei and W. Samotij: Large bounded degree trees in expanding graphs, Electronic Journal of Combinatorics 17, Research Paper 6, 2010.
5. B. Bollobás: Cycles modulo k, Bulletin of the London Mathematical Society 9 (1977), 97–98.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献