Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference37 articles.
1. Alon N, Asodi V (2002) Sparse universal graphs, probabilistic methods in combinatorics and combinatorial optimization. J Comput Appl Math 142:1–11
2. Alon N, Capalbo M (2007) Sparse universal graphs for bounded-degree graphs. Random Struct Algorithms 31:123–133
3. Alon N, Spencer J (1992) The probabilistic method. Wiley, New York
4. Alon N, Capalbo M, Kohayakawa Y, Rödl V, Ruciński A, Szemerédi E (2000) Universality and tolerance (extended abstract). In: 41st annual symposium on foundations of computer science (Redondo Beach, CA, 2000). IEEE Comput. Soc. Press, Los Alamitos, pp 14–21
5. Alon N, Krivelevich M, Sudakov B (2007) Embedding nearly-spanning bounded degree trees. Combinatorica 27:629–644
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Random bipartite Ramsey numbers of long cycles;Discrete Applied Mathematics;2024-04
2. Graph partitioning: an updated survey;AKCE International Journal of Graphs and Combinatorics;2022-11-22
3. Bipartite Ramsey Numbers of Cycles for Random Graphs;Graphs and Combinatorics;2021-07-25
4. Bipartite Ramsey numbers of paths for random graphs;Discrete Applied Mathematics;2019-02