Jump to content

Ore's theorem: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

5 July 2021

10 April 2020

13 November 2019

14 January 2019

5 September 2018

  • curprev 17:3017:30, 5 September 2018Tidycanary talk contribs 8,444 bytes −852 The previous first paragraph was the proof of a completely different statement (Let G be a graph on n vertices and suppose that for every two non-adjacent vertices v and u, deg(v) + deg(u) ≥ n + 1 . Then G is Hamiltonian-connected.) undo

8 April 2018

25 March 2018

14 March 2018

27 October 2017

26 October 2017

31 January 2016

10 December 2015

10 November 2015

10 August 2015

11 August 2014

27 December 2013

  • curprev 18:4518:45, 27 December 2013David Eppstein talk contribs 8,381 bytes +11 Avoid using "any" as a quantifier; it's too confusing (evidence: http://cstheory.stackexchange.com/questions/20344/ores-theorem-consistent-or-not-in-accordance-with-hamiltonian-graph) undo

3 April 2013

6 March 2013

5 January 2013

4 January 2013

20 July 2012

7 April 2012

4 February 2012

30 November 2011

1 November 2011

15 October 2011

28 July 2011

19 April 2011

10 April 2011

28 December 2010

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)