Answers are grounded in this paper and cite their sources.
We consider maximum rooted tree extension counts in random graphs, that is, we consider where counts the number of copies of a given tree in rooted at vertex . We determine the asymptotics of when the random graph is not too sparse, specifically when the edge probability satisfies . The problem is more difficult in the sparser regime , where we determine the asymptotics of for specific classes of trees. Interestingly, here our large deviation type optimization arguments reveal that the behavior of changes as we vary , due to different mechanisms that can make the maximum large.
No takes yet. Share an insight, caveat, or question.
Šileikis et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: