Ramsey numbers of cycles in random graphs-Reference-Cited by-同舟云学术

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

Ramsey numbers of cycles in random graphs

Published:2024-08-09 Issue: Volume: Page:
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct Algorithms

Author:

Araújo Pedro¹^ORCID,Pavez‐Signé Matías²,Sanhueza‐Matamala Nicolás³

Affiliation:

1. Department of Mathematics, Faculty of Nuclear Sciences and Physical Engineering Czech Technical University in Prague Prague Czech Republic

2. Centro de Modelamiento Matemático (CNRS IRL2807) Universidad de Chile Santiago Chile

3. Departamento de Ingeniería Matemática Facultad de Ciencias Físicas y Matemáticas, Universidad de Concepción Chile

Abstract

AbstractLet be the Ramsey number of the cycle on vertices. We prove that, for some , with high probability every 2‐coloring of the edges of has a monochromatic copy of , as long as and . This is sharp up to the value of and it improves results of Letzter and of Krivelevich, Kronenberg, and Mond.

Funder

Grantová Agentura České Republiky

H2020 European Research Council

Publisher

Wiley

Link

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

Reference26 articles.

1. Local resilience of almost spanning trees in random graphs

2. Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP