Reputation
Top tag
Next privilege 75 Rep.
Set bounties
Badges
2
Newest
 Supporter
Impact
~2k people reached

  • 0 posts edited
  • 0 helpful flags
  • 2 votes cast
Apr
27
comment What condition need to be imposed on Havel-Hakimi theorem to check for connected graph?
Re-reading the question again, I realize I gave a non-answer. I showed that if there is a partition then there is a non-connected graph (and with the way the method works, I think the non-connected graph solution is (always?) chosen). I think the weaker statement: a graphical sequence which does not have a partitioning must be connected is is provable (if not obvious) and maybe isomorphic to what @MartinSleziak stated. Perhaps a proof by construction (consider how a sequence changes when you add a node or edge to the graph).
Apr
11
answered What condition need to be imposed on Havel-Hakimi theorem to check for connected graph?
Dec
23
awarded  Supporter
Jan
31
awarded  Teacher
Jan
29
answered Chance of meeting in a bar