A jump of the saturation number in random graphs?

Diskin, S. orcid.org/0000-0002-5586-8152, Hoshen, I. and Zhukovskii, M. orcid.org/0000-0001-8763-9533 (2025) A jump of the saturation number in random graphs? Random Structures & Algorithms, 66 (4). e70009. ISSN 1042-9832

Metadata

Item Type: Article
Authors/Creators:
Copyright, Publisher and Additional Information:

© 2025 The Author(s). This is an open access article under the terms of the Creative Commons Attribution License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited. http://creativecommons.org/licenses/by/4.0/
Keywords: probablistic combinatorics; random graphs; saturation number
Dates:
  • Submitted: 6 April 2023
  • Accepted: 3 April 2025
  • Published (online): 14 June 2025
  • Published: July 2025
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 17 Jun 2025 08:50
Last Modified: 17 Jun 2025 08:50
Status: Published
Publisher: Wiley
Refereed: Yes
Identification Number: 10.1002/rsa.70009
Open Archives Initiative ID (OAI ID):

Export

Statistics


CORE (COnnecting REpositories)