Jump to content

Talk:Zorn's lemma

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 2602:306:b8e0:82c0:c57c:a2c7:42ea:556a (talk) at 02:08, 28 May 2015. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

WikiProject iconMathematics C‑class High‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
CThis article has been rated as C-class on Wikipedia's content assessment scale.
HighThis article has been rated as High-priority on the project's priority scale.

Zorn's lemma CAN'T be used to show that every graph has a spanning tree

The assertion is not true. Only connected graphs have spanning trees. The mistake in the proof happens here:

Zorn's lemma says that a maximal tree must exist, which is a spanning tree.

Maximal trees in disconnected grpahs aren't spanning trees. --Jobu0101 (talk) 20:41, 5 January 2015 (UTC)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Zorn%27s_lemma&oldid=664357721"