Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference17 articles.
1. B. Bollobás: Extremal graph theory, volume 11 of London Mathematical Society Monographs, Academic Press Inc. [Harcourt Brace Jovanovich Publishers], London, 1978.
2. J. Bourgain and A. Gamburd: Uniform expansion bounds for Cayley graphs of SL 2(Fp), Ann. of Maths 167 (2008), 625–642.
3. G. Davidoff, P. Sarnak and A. Valette: Elementary number theory, group theory, and Ramanujan graphs, volume 55 of London Math. Soc. Student Texts, Cambridge University Press, 2003.
4. P. Dusart: The k-th prime is greater than k(lnk+ln lnk−) for k≥2, Mathematics of Computation of the American Mathematical Society 68 (1999), 411–415.
5. P. Erdős and H. Sachs: Reguläre Graphen gegebener Tailenweite mit minimaler Knollenzahh, Wiss. Z. Univ. Halle-Willenberg Math. Nat., 12:251–258, 1963.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Balanced allocation on hypergraphs;Journal of Computer and System Sciences;2023-12
2. First-order Logic with Connectivity Operators;ACM Transactions on Computational Logic;2023-07-25
3. Results and Problems on Chorded Cycles: A Survey;Graphs and Combinatorics;2022-11-17
4. Distributed Lower Bounds for Ruling Sets;SIAM Journal on Computing;2022-02
5. Kissing Numbers of Regular Graphs;Combinatorica;2021-11-25