Sparse partition universal graphs for graphs of bounded degree-Reference-Cited by-同舟云学术

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

Sparse partition universal graphs for graphs of bounded degree

Published:2011-04 Issue:6 Volume:226 Page:5041-5065
ISSN:0001-8708
Container-title:Advances in Mathematics
language:en
Short-container-title:Advances in Mathematics

Author:

Kohayakawa Yoshiharu,Rödl Vojtěch,Schacht Mathias,Szemerédi Endre

Funder

CAPES–DAAD

FAPESP

CNPq

Publisher

Elsevier BV

Subject

General Mathematics

Reference36 articles.

1. Sparse universal graphs for bounded-degree graphs;Alon;Random Structures Algorithms,2007

2. N. Alon, M.R. Capalbo, Optimal universal graphs with deterministic embedding, in: Proceedings of the 19th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA 2008, 2008, pp. 373–378.

3. Spanning subgraphs of random graphs;Alon;Graphs Combin.,1992

4. Universality and tolerance (extended abstract);Alon,2000

5. Near-optimum universal graphs for graphs with bounded degrees (extended abstract);Alon,2001

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

1. Effective Bounds for Induced Size-Ramsey Numbers of Cycles;Combinatorica;2024-05-14

2. Random bipartite Ramsey numbers of long cycles;Discrete Applied Mathematics;2024-04

3. On Bounded Degree Graphs with Large Size-Ramsey Numbers;Combinatorica;2023-08-21

4. On the size-Ramsey number of grids;Combinatorics, Probability and Computing;2023-06-26

5. Maculopapular Drug Eruptions: Diversity of Histopathological Changes;European Archives of Medical Research;2023-06-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP