Cycle Saturation in Random Graphs

DOI10.1137/21m1456479zbMath1519.05216arXiv2109.05758OpenAlexW4383822034MaRDI QIDQ6170438

Arkadiy Skorkin, Yury A. Demidovich, M. E. Zhukovskii

Publication date: 10 August 2023

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2109.05758

zbMATH Keywords

cyclesrandom graphssaturation number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of minimum saturated graphs
• Weak saturation numbers for multiple copies
• Matching and covering the vertices of a random graph by copies of a given graph
• Small maximal matchings in random graphs.
• Star saturation number of random graphs
• Threshold functions for extension statements
• Maximum sparse induced subgraphs of the binomial random graph with given number of edges
• On the number of edges in a minimum \(C_6\)-saturated graph
• Factors in random graphs
• Minimum C₅‐saturated graphs
• Saturated graphs with minimal number of edges
• Threshold Functions for H-factors
• On Pósa's Conjecture for Random Graphs
• Cycle-Saturated Graphs with Minimum Number of Edges
• A Problem in Graph Theory
• Saturation in random graphs

This page was built for publication: Cycle Saturation in Random Graphs