Database
GRAPH THEORY
The Friendship Theorem
Huneke's Proof of the Friendship Theorem
Metamath Proof Explorer
Table of Contents - 16.5.4. Huneke's Proof of the Friendship Theorem
In this section, the friendship theorem friendship is proven by formalizing
Huneke's proof, see [Huneke ] pp. 1-2. The three claims (see frgrncvvdeq ,
frgrregorufr and frrusgrord0 ) and additional statements (numbered in the
order of their occurrence in the paper) in Huneke's proof are cited in the
corresponding theorems.
frgrncvvdeqlem1
frgrncvvdeqlem2
frgrncvvdeqlem3
frgrncvvdeqlem4
frgrncvvdeqlem5
frgrncvvdeqlem6
frgrncvvdeqlem7
frgrncvvdeqlem8
frgrncvvdeqlem9
frgrncvvdeqlem10
frgrncvvdeq
frgrwopreglem4a
frgrwopreglem5a
frgrwopreglem1
frgrwopreglem2
frgrwopreglem3
frgrwopreglem4
frgrwopregasn
frgrwopregbsn
frgrwopreg1
frgrwopreg2
frgrwopreglem5lem
frgrwopreglem5
frgrwopreglem5ALT
frgrwopreg
frgrregorufr0
frgrregorufr
frgrregorufrg
frgr2wwlkeu
frgr2wwlkn0
frgr2wwlk1
frgr2wsp1
frgr2wwlkeqm
frgrhash2wsp
fusgreg2wsplem
fusgr2wsp2nb
fusgreghash2wspv
fusgreg2wsp
2wspmdisj
fusgreghash2wsp
frrusgrord0lem
frrusgrord0
frrusgrord
numclwwlk2lem1lem
2clwwlklem
clwwnrepclwwn
clwwnonrepclwwnon
2clwwlk2clwwlklem
2clwwlk
2clwwlk2
2clwwlkel
2clwwlk2clwwlk
numclwwlk1lem2foalem
extwwlkfab
extwwlkfabel
numclwwlk1lem2foa
numclwwlk1lem2f
numclwwlk1lem2fv
numclwwlk1lem2f1
numclwwlk1lem2fo
numclwwlk1lem2f1o
numclwwlk1lem2
numclwwlk1
clwwlknonclwlknonf1o
clwwlknonclwlknonen
dlwwlknondlwlknonf1olem1
dlwwlknondlwlknonf1o
dlwwlknondlwlknonen
wlkl0
clwlknon2num
numclwlk1lem1
numclwlk1lem2
numclwlk1
numclwwlkovh0
numclwwlkovh
numclwwlkovq
numclwwlkqhash
numclwwlk2lem1
numclwlk2lem2f
numclwlk2lem2fv
numclwlk2lem2f1o
numclwwlk2lem3
numclwwlk2
numclwwlk3lem1
numclwwlk3lem2lem
numclwwlk3lem2
numclwwlk3
numclwwlk4
numclwwlk5lem
numclwwlk5
numclwwlk7lem
numclwwlk6
numclwwlk7
numclwwlk8
frgrreggt1
frgrreg
frgrregord013
frgrregord13
frgrogt3nreg
friendshipgt3
friendship