A note on long cycles in sparse random graphs
Anastos M. 2023. A note on long cycles in sparse random graphs. Electronic Journal of Combinatorics. 30(2), P2.21.
Download
DOI
Journal Article
| Published
| English
Scopus indexed
Author
Department
Abstract
Let Lc,n denote the size of the longest cycle in G(n, c/n),c >1 constant. We show that there exists a continuous function f(c) such that Lc,n/n→f(c) a.s. for c>20, thus extending a result of Frieze and the author to smaller values of c. Thereafter, for c>20, we determine the limit of the probability that G(n, c/n)contains cycles of every length between the length of its shortest and its longest cycles as n→∞.
Publishing Year
Date Published
2023-05-05
Journal Title
Electronic Journal of Combinatorics
Publisher
Electronic Journal of Combinatorics
Acknowledgement
We would like to thank the reviewers for their helpful comments and remarks.
Volume
30
Issue
2
Article Number
P2.21
eISSN
IST-REx-ID
Cite this
Anastos M. A note on long cycles in sparse random graphs. Electronic Journal of Combinatorics. 2023;30(2). doi:10.37236/11471
Anastos, M. (2023). A note on long cycles in sparse random graphs. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/11471
Anastos, Michael. “A Note on Long Cycles in Sparse Random Graphs.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2023. https://doi.org/10.37236/11471.
M. Anastos, “A note on long cycles in sparse random graphs,” Electronic Journal of Combinatorics, vol. 30, no. 2. Electronic Journal of Combinatorics, 2023.
Anastos M. 2023. A note on long cycles in sparse random graphs. Electronic Journal of Combinatorics. 30(2), P2.21.
Anastos, Michael. “A Note on Long Cycles in Sparse Random Graphs.” Electronic Journal of Combinatorics, vol. 30, no. 2, P2.21, Electronic Journal of Combinatorics, 2023, doi:10.37236/11471.
All files available under the following license(s):
Creative Commons Attribution 4.0 International Public License (CC-BY 4.0):
Main File(s)
File Name
2023_JourCombinatorics_Anastos.pdf
448.74 KB
Access Level
Open Access
Date Uploaded
2023-05-22
MD5 Checksum
6269ed3b3eded6536d3d9d6baad2d5b9
Export
Marked PublicationsOpen Data ISTA Research Explorer
Web of Science
View record in Web of Science®Sources
arXiv 2105.13828
Google Scholar