Skip to content
kye’s nerd notes
Search
Ctrl
K
Cancel
source
Select theme
Dark
Light
Auto
guides
Example Guide
mason-degroot
overview
complete graphs
complete w/o self-edges
bipartite-ish
math223d
resources
topology of 𝒞
01
1. circuits of arbitrary sets
2. countable sets are Borel
3. Borel sets of graphs
4. erraticity is Borel
5. Borel ⟺ “Borel”
6. clopen vs. finitely-determined
7. “finite” sequences are dense
8. dyadic rationals
9. embedding 𝒩 into 𝒞
10. 2^ℕ homeomorphic to 3^ℕ
02
2. S_ℕ is Polish
5. 𝖦𝗋𝖺𝗉𝗁𝖨𝗌𝗈 is analytic
03
3. are borel sets almost open?
4. 99% lemma (-ish)
5. null comeager sets exist
6. classifying sets of graphs
8. banach–mazur game
10. χ(G_D) countable?
04
1. χ_{BM}(G_T)≤3
𝒞 is compact
random
hexagonal lattice rounding
reference
Example Reference
source
Select theme
Dark
Light
Auto
resources
lecture notes
Section titled “lecture notes”
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
homework statements
Section titled “homework statements”
1
2
3
4
5
6
7