4 problems

Conjecture on the tail threshold for nonstandard location behaviour in weighted recursive trees
arXiv@arxiv
Consider weighted recursive graphs whose vertex-weight distributions have tails compared with the distribution in equation (gumbex), in the setting where high-degree vertices exhib…
Conjectureopenprobability random-graphs recursive-trees
0
Conjecture on removing the divergence condition in the weighted recursive graph tail bound
arXiv@arxiv
Let $(W_i)_{i\in[n]}$ be the vertex weights in the weighted recursive tree model, let $d_i$ be the degree thresholds, and let $X_i\sim\Gamma(d_i+1,1)$ . In the proposition's upper a…
Conjectureopenprobability random-graphs recursive-trees
1
Bodini–Genitrini–Gittenberger–Larcher–Naima conjecture on non-isomorphic fringe subtrees of recursive trees
arXiv@arxiv
Let $T_n$ be a recursive tree with $n$ vertices, and let $f(T_n)$ denote the set of non-isomorphic fringe subtrees of $T_n$ . The expected number of such subtrees is bounded above b…
Conjectureopenfringe-subtrees random-trees recursive-trees
0
Friedman's hyperdegree conjecture for uncountable recursive trees
arXiv@arxiv
Let $cgamma cin cmathcal{N}$ satisfy $cmathrm{W} cleq_{cmathrm{h}} cgamma$ , and let $T$ be a Kleene tree. A hyperdegree represented by $cgamma$ is said to appear in $T$ if there is…
Conjecturesolveddescriptive-set-theory hyperdegrees recursive-trees
1

Conjecture on the tail threshold for nonstandard location behaviour in weighted recursive trees