Year: 2026
Type: article
Abstract: 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.
Source: Random Structures and Algorithms
DOI: 10.1002/rsa.70096
Authors: Pedro Araújo, Simon Griffiths, Matas Šileikis, Lutz Warnke
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4387836494
