New posts in trees

Let $n \ge 9$. How many trees are there on vertex set $[n]$ such that at least one vertex has degree $n-3$?

What does $\lg x$ mean? is it $\log_2 x$ or $\log_{10} x$ in binary trees

Proving every tree has at most one perfect matching

Counting $k$-ary labelled trees

Graph Theory - Minimum Spanning Tree (MST) Question

Condition on degrees for existence of a tree

How can I prove the identity $2(n-1)n^{n-2}=\sum_k\binom{n}{k}k^{k-1}(n-k)^{n-k-1}$?

Number of rooted subtrees of given size in infinite d-regular tree

Show that if G is a simple graph with at least 4 vertices and 2n-3 edges, it must have two cycles of the same length.

Partition a binary tree by removing a single edge

Ordinal interpretation of Friedman's $n$?

How many edges does an undirected tree with $n$ nodes have?

Need a counter example for cycle in a graph

How do I visualize a tree dfs traversal?

Is there a "tree-like" proof of compactness theorem in the case of uncountably many variables?

Proof that TREE(n) where n >= 3 is finite?

Number of all labeled, unordered rooted trees with $n$ vertices and $k$ leaves.

How many different spanning trees of $K_n \setminus e$ are there?

Tree and total probability rule (two events)

Does every "balloon" (dragon, tadpole, canoe paddle) admit a graceful labeling?