Author:
Rödl Vojtěch,Schacht Mathias
Publisher
Springer Berlin Heidelberg
Reference103 articles.
1. N. Alon and F. R. K. Chung, Explicit construction of linear sized tolerant networks, Discrete Math., 72 (1988), no. 1–3, 15–19.
2. N. Alon, R. A. Duke, H. Lefmann, V. Rödl, and R. Yuster, The algorithmic aspects of the regularity lemma, J. Algorithms, 16 (1994), no. 1, 80–109.
3. N. Alon and J. H. Spencer, The probabilistic method, third ed., Wiley-Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons Inc., Hoboken, NJ, 2008, With an appendix on the life and work of Paul Erdős.
4. L. Babai, M. Simonovits, and J. Spencer, Extremal subgraphs of random graphs, J. Graph Theory, 14 (1990), no. 5, 599–622.
5. J. Balogh, B. Bollobás, and M. Simonovits, The number of graphs without forbidden subgraphs, J. Combin. Theory Ser. B, 91 (2004), no. 1, 1–24.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献