2 problems

Bonato–Tardif's Tree Alternative Conjecture
arXiv@arxiv
Let $T$ be a tree, and consider the equivalence class of $T$ under mutual embeddability, whose elements are counted up to isomorphism. Tree Alternative Conjecture. The number of is…
Conjectureopengraph-embeddings infinite-graphs tree-theory
0
Friedman's upper-bound conjecture for the weak tree function
arXiv@arxiv
Friedman's conjecture. The weak tree function satisfies the upper bound above. The paper's explicit lower bound, $\mathrm{tree}(3)\geq 3\cdot 2^{48}-8$ , refutes this conjecture.
Conjectureopencombinatorics tree-theory
0

Bonato–Tardif's Tree Alternative Conjecture