登录 注册 会员服务 联系我们

An improved upper bound on the density of universal random graphs

  • Published:2014-05-22 Issue:2 Volume:46 Page:274-299
  • ISSN:1042-9832
  • Container-title:Random Structures & Algorithms
  • language:en
  • Short-container-title:Random Struct. Alg.

Author:

Dellamonica Domingos1,Kohayakawa Yoshiharu12,Rödl Vojtěch1,Ruciński Andrzej13

Affiliation:

1. Department of Mathematics and Computer Science; Emory University; Atlanta Georgia 30322

2. Instituto de Matemática e Estatística; Universidade de São Paulo; Rua do Matão 1010 05508-090 São Paulo Brazil

3. Department of Discrete Mathematics; Adam Mickiewicz University; 61-614 Poznań Poland

Funder

National Science Foundation

São Paulo Research Foundation

Polish NSC grant

CAPES-Fulbright

CNPq

NUMEC/USP

Publisher

Wiley

Subject

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

Reference21 articles.

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

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

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

3. Spanning universality in random graphs;Random Structures & Algorithms;2018-10-18

4. Sparse multipartite graphs as partition universal for graphs with bounded degree;Journal of Combinatorial Optimization;2017-11-16

5. Spanning structures and universality in sparse hypergraphs;Random Structures & Algorithms;2016-10-11
同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3