Skip to main content
Mathematics
JR03's user avatar
JR03's user avatar
JR03's user avatar
JR03
  • Member for 27 days
  • Last seen more than a week ago
Profile Activity
Stats
11
reputation
49
reached
0
answers
1
question
Communities
Badges

This user has not earned any badges.

Top tags
0
Score
1
Posts
100
Posts %
0
Score
1
Posts
100
Posts %
0
Score
1
Posts
100
Posts %
Top posts
0
Proof that if a graph has edge connectivity 3, then the girth is bounded by the number of nodes divided by two + 1, g(G) <= |V(G)| / 2 + 1
Jun 24