RE: Ran Across An Interesting Math Problem - Can You Solve It?

You are viewing a single comment's thread from:

Ran Across An Interesting Math Problem - Can You Solve It?

in math •  7 years ago  (edited)

For the proof of the theorem that an acyclic graph with finite vertices must have a leaf, see the article "Acyclic graph must have a leaf" on math.stackexchange.com
There is a reply that shows a "tree(connected, acyclic graph)" with finite vertices has a leaf. One can easily generalize this theorem and prove that a "forest(acyclic graph)" with finite vertices must have a leaf.

math
7 years ago by

Downvoting a post can decrease pending rewards and make it less visible. Common reasons:

  • Disagreement on rewards
  • Fraud or plagiarism
  • Hate speech or trolling
  • Miscategorized content or spam

Submit
$0.00
    1
    Authors get paid when people like you upvote their post.
    If you enjoyed what you read here, create your account today and start earning FREE STEEM!
    Sort Order:  
  • Trending
    • [-]
      ·  7 years ago 

    Will do, thanks. I'm checking the proof right now. Thanks for the response.

    Downvoting a post can decrease pending rewards and make it less visible. Common reasons:

    • Disagreement on rewards
    • Fraud or plagiarism
    • Hate speech or trolling
    • Miscategorized content or spam

    Submit
    $0.00