Abstract <p>An improvement of Riordan’s result on the threshold probability of the occurrence of a spanning subgraph in a random graph is obtained for some classes of subgraphs. In particular, this result implies an improved bound for the maximum power of a Hamiltonian cycle in a random graph. Moreover, a sharp asymptotic threshold probability for a random graph to contain spanning subgraphs from a wide class of <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(k\)</EquationSource> <!--DANMath2570017Serkova-m1--> </InlineEquation>-degenerate graphs is found.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

On Certain Spanning Subgraphs of Random Graphs

  • O. I. Serkova

摘要

Abstract

An improvement of Riordan’s result on the threshold probability of the occurrence of a spanning subgraph in a random graph is obtained for some classes of subgraphs. In particular, this result implies an improved bound for the maximum power of a Hamiltonian cycle in a random graph. Moreover, a sharp asymptotic threshold probability for a random graph to contain spanning subgraphs from a wide class of \(k\) -degenerate graphs is found.