Talk:Pancyclic graph

A fact from Pancyclic graph appeared on Wikipedia's Main Page in the Did you know column on 14 September 2010 (check views). The text of the entry was as follows: Did you know... that every round-robin tournament either has a set of players who win all games against players outside the set, or its graph of wins and losses is pancyclic, having directed cycles of all lengths? A record of the entry may be seen at Wikipedia:Recent additions/2010/September.

This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Mathematics Low‑priority This 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 Low This article has been rated as Low-priority on the project's priority scale.

Fragment graph in which each edge has degree at least (section Graphs with many edges), I think, has error...

Must be graph in which each node has degree at least Jumpow (talk) 11:06, 11 September 2016 (UTC)[reply]

 Done Thanks for catching this. —David Eppstein (talk) 17:49, 11 September 2016 (UTC)[reply]