A scaling limit for the length of the longest cycle in a sparse random digraph-Reference-Cited by-同舟云学术

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

A scaling limit for the length of the longest cycle in a sparse random digraph

Published:2021-06-14 Issue:1 Volume:60 Page:3-24
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct Alg

Author:

Anastos Michael¹,Frieze Alan²

Affiliation:

1. Department of Mathematics and Computer Science Freie Universität Berlin Berlin Germany

2. Department of Mathematical Sciences Carnegie Mellon University Pittsburgh Pennsylvania USA

Publisher

Wiley

Subject

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

Link

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

Reference15 articles.

1. A scaling limit for the length of the longest cycle in a sparse random graph

2. Maximum matchings in sparse random graphs: Karp–Sipser revisited

3. On matchings and Hamiltonian cycles in random graphs;Bollobás B.;Ann. Discrete Math.,1985

4. Almost all graphs with 1.44n edges are 3-colorable

5. Hamilton Cycles in a Class of Random Directed Graphs

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

1. A Note on Long Cycles in Sparse Random Graphs;The Electronic Journal of Combinatorics;2023-05-05

2. Depth first exploration of a configuration model;Electronic Journal of Probability;2022-01-01

3. Cycle lengths in sparse random graphs;Random Structures & Algorithms;2021-12-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP