On certain spanning subgraphs of random graphs

DOI10.1134/S1064562425700176MaRDI QIDQ6876335zbMATH OpenFDO

Authors O. I. Serkova

Publication date 13 January 2026

Published in Doklady Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S1064562425700176

zbMATH Keywords

\(k\)-degenerate graphHamiltonian cyclerandom graphspanning subgraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Boolean algebras (Boolean rings) (06Exx) Combinatorial probability (60Cxx)

Cites work

• A proof of the Kahn–Kalai conjecture
• Hamiltonian circuits in random graphs
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• Hunting for sharp thresholds
• On Pósa's conjecture for random graphs
• Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs
• Sharp thresholds of graph properties, and the k-sat problem
• Spanning Subgraphs of Random Graphs
• The threshold for the square of a Hamilton cycle
• Threshold functions
• Thresholds and Expectation Thresholds
• Thresholds versus fractional expectation-thresholds
• Triangle resilience of the square of a Hamilton cycle in random graphs

This page was built for publication: On certain spanning subgraphs of random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6876335)