Question

Can we "complete" the standard binary tree to have a "level at infinity"?

score 791 · Answer 1 · 2021-04-18 21:36:03

791

Views

Can we "complete" the standard binary tree to have a "level at infinity"?

Published on 18 Apr 2021 - 21:36

score 44 · Answer 2 · 2021-04-20 19:41:03

44

Views

Let $ G $ be a tree and $ V_0 = \left \lbrace v \in V(G) | deg (v) = 1 \right \rbrace $. Show that $ G \setminus V_0 $ is a tree.

Published on 20 Apr 2021 - 19:41

score 71 · Answer 3 · 2021-04-25 07:35:56

71

Views

Is my Graph Theory proof accurate ? Tree proof

Published on 25 Apr 2021 - 7:35

score 55 · Answer 4 · 2026-03-29 21:50:40

55

Views

Laver forcing, trees and stems

Published on 29 Mar 2026 - 21:50

score 81 · Answer 5 · 2021-04-26 17:44:55

81

Views

Quadrivalent Trees

Published on 26 Apr 2021 - 17:44

score 360 · Answer 6 · 2021-04-27 09:53:26

360

Views

König's Lemma in set theory, why is the finite branching needed?

Published on 27 Apr 2021 - 9:53

score 313 · Answer 7 · 2021-04-27 14:05:58

313

Views

Number of leaves in tree

Published on 27 Apr 2021 - 14:05

score 297 · Answer 8 · 2026-03-26 18:59:41

297

Views

Does any connected graph G have a spanning tree T with the same domination number?

Published on 26 Mar 2026 - 18:59

score 136 · Answer 9 · 2021-04-30 00:24:48

136

Views

The trees $T_i$ and $T_j$ have a vertex in common. Show that $T$ has a vertex which is in all of the $T_i$.

Published on 30 Apr 2021 - 0:24

score 84 · Answer 10 · 2021-04-30 14:10:11

84

Views

Proving Cayley s formula from a sum

Published on 30 Apr 2021 - 14:10

score 41 · Answer 11 · 2026-03-28 08:08:06

41

Views

Unsure of graph isomorphism

Published on 28 Mar 2026 - 8:08

score 172 · Answer 12 · 2021-05-05 10:20:41

Proof in Graph Theory: if every vertex adjacent to leaf has degree of at least 3 then there exists two leaves who are adjacent to same vertex

score 75 · Answer 13 · 2026-03-29 12:50:43

75

Views

When does a RAAG act on a Tree?

Published on 29 Mar 2026 - 12:50

score 549 · Answer 14 · 2021-05-05 23:39:41

549

Views

$T_{n}$ a set of all binary trees with $n$ leaves

Published on 05 May 2021 - 23:39

score 545 · Answer 15 · 2026-03-26 20:40:39

545

Views

Is there a way to know how many non-isomorphic spanning trees there are for a graph?

Published on 26 Mar 2026 - 20:40

List Question

Can we "complete" the standard binary tree to have a "level at infinity"?

Let $ G $ be a tree and $ V_0 = \left \lbrace v \in V(G) | deg (v) = 1 \right \rbrace $. Show that $ G \setminus V_0 $ is a tree.

Is my Graph Theory proof accurate ? Tree proof

Laver forcing, trees and stems

Quadrivalent Trees

König's Lemma in set theory, why is the finite branching needed?

Number of leaves in tree

Does any connected graph G have a spanning tree T with the same domination number?

The trees $T_i$ and $T_j$ have a vertex in common. Show that $T$ has a vertex which is in all of the $T_i$.

Proving Cayley s formula from a sum

Unsure of graph isomorphism

Proof in Graph Theory: if every vertex adjacent to leaf has degree of at least 3 then there exists two leaves who are adjacent to same vertex

When does a RAAG act on a Tree?

$T_{n}$ a set of all binary trees with $n$ leaves

Is there a way to know how many non-isomorphic spanning trees there are for a graph?

Trending Questions

Popular # Hahtags

Popular Questions