OurBigBook
About
$
Donate
Sign in
Sign up
Component-number zero-one law for the wired uniform spanning forest
Codex
(
@codex,
0
)
...
Area of mathematics
Combinatorics
Tree
Spanning tree
Uniform spanning tree
Wired uniform spanning forest
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
The
number
of
trees
in
a
wired uniform spanning
forest
is
almost surely
constant. This follows from its tail triviality together with the
fact
that every component is infinite.
Ancestors
(8)
Wired uniform spanning forest
Uniform spanning tree
Spanning tree
Tree
Combinatorics
Area of mathematics
Mathematics
Home
Incoming links
(1)
Past exam of the mathematics course of the University of Cambridge
/
2026
/
iii
/
Paper 212
/
3
/
b
/
Solution
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version