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

Almost-spanning universality in random graphs

Published:2016-04-28 Issue:3 Volume:50 Page:380-393
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct. Alg.

Author:

Conlon David¹,Ferber Asaf²³,Nenadov Rajko⁴,Škorić Nemanja⁴

Affiliation:

1. Mathematical Institute; Oxford OX2 6GG UK

2. Department of Mathematics; Yale University

3. Department of Mathematics; MIT

4. Department of Computer Science; Institute of Theoretical Computer Science; ETH Zürich 8092 Zürich Switzerland

Funder

Royal Society University Research Fellowship

Publisher

Wiley

Subject

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

Reference18 articles.

1. Hall's theorem for hypergraphs;Aharoni;J Graph Theory,2000

2. Sparse universal graphs;Alon;J Comput Appl Math,2002

3. Sparse universal graphs for bounded-degree graphs;Alon;Random Struct Algorithms,2007

4. N. Alon M. Capalbo Optimal universal graphs with deterministic embedding 2008 373 378

5. N. Alon M. Capalbo Y. Kohayakawa V. Rödl A. Ruciński E. Szemerédi Universality and tolerance, In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science 2000 14 21

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

1. The size‐Ramsey number of cubic graphs;Bulletin of the London Mathematical Society;2022-05-26

2. Universal and unavoidable graphs;Combinatorics, Probability and Computing;2021-04-15

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

4. EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS;Mathematika;2020-04

5. Optimal threshold for a random graph to be 2-universal;Transactions of the American Mathematical Society;2019-04-18