ON THE SIZES OF k-SUBGRAPHS OF THE BINOMIAL RANDOM GRAPH
Consider — the set of all sizes (numbers of edges) of induced subgraphs of size in a given graph with vertices. For the binomial random graph , we proved that, for each and small enough, the set with high probability contains a large segment for all such that . We also found the asymptotic length of this segment.
Authors
- Yu. N. Yarovikov
Publication Details
- Journal
- Доклады Российской академии наук Математика информатика процессы управления / Doklady Mathematics
- Published
- 2025-01-01
- DOI
- https://doi.org/10.7868/s3034504925030128
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00