New answers tagged trees
3
votes
Accepted
Simplified method of building an Aronszajn tree
Your argument is basically Kurepa's proof from his thesis Ensembles ordonnées et ramifiés, see page 96 (a footnote has Aronszajn's construction).
As noted in the comments you need to show that what ...
Top 50 recent answers are included
Related Tags
trees × 229graph-theory × 105
co.combinatorics × 93
pr.probability × 27
reference-request × 21
set-theory × 21
gr.group-theory × 17
lo.logic × 14
enumerative-combinatorics × 14
mg.metric-geometry × 13
algorithms × 13
spanning-tree × 12
geometric-group-theory × 9
terminology × 7
random-walks × 7
spectral-graph-theory × 7
nt.number-theory × 6
binary-tree × 6
large-cardinals × 5
extremal-graph-theory × 5
fa.functional-analysis × 4
discrete-geometry × 4
asymptotics × 4
group-actions × 4
infinite-combinatorics × 4