Spanning universality in random graphs-Reference-Cited by-同舟云学术

Spanning universality in random graphs

Published:2018-10-18 Issue:4 Volume:53 Page:604-637
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct Alg

Author:

Ferber Asaf¹,Nenadov Rajko²

Affiliation:

1. Department of Applied MathematicsMITCambridgeMassachusetts

2. School of Mathematical SciencesMonash UniversityMelbourneAustralia

Funder

NSF

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/rsa.20816

Reference31 articles.

1. Local resilience of spanning subgraphs in sparse random graphs

2. P.Allen J.Böttcher H.Hàn Y.Kohayakawa andY.Person Blow‐up lemmas for sparse graphs. arXiv: 1612.00622 (2016).

3. N.Alon M.Capalbo Y.Kohayakawa V.Rödl A.Ruciński andE.Szemerédi Universality and tolerance. Proceedings of the 41st Annual Symposium on Foundations of Computer Science IEEE Washington DC pp.14–21 2000.

4. Spanning subgraphs of random graphs

5. Embedding nearly-spanning bounded degree trees

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs;Random Structures & Algorithms;2021-10-14

2. Random Perturbation of Sparse Graphs;The Electronic Journal of Combinatorics;2021-05-21

3. Tilings in randomly perturbed graphs: Bridging the gap between Hajnal‐Szemerédi and Johansson‐Kahn‐Vu;Random Structures & Algorithms;2020-11-28

4. 2-universality in randomly perturbed graphs;European Journal of Combinatorics;2020-06

5. Finding any given 2‐factor in sparse pseudorandom graphs efficiently;Journal of Graph Theory;2020-05-05