PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
October 4, 2024Доклады Российской академии наук Математика информатика процессы управления0 citations

Maximum induced trees in sparse random graphs

View Full Paper
JOJ. C. Buitrago Oropeza

Key Points

Key points are not available for this paper at this time.

Abstract

We prove that a.a.s. for anyε0andn−e−23e−2+ε≤p=o(1)the maximum size of an induced subtree of the binomial random graphGn,pis concentrated in 2 consecutive points.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

J. C. Buitrago Oropeza (2024) studied this question.

synapsesocial.com/papers/68e55da2e2b3180350efa96dhttps://doi.org/10.31857/s2686954324020133
Ask AI
Helpful
Bookmark
Share
View Full Paper