Jump to content

Kruskal's tree 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)

21 October 2024

29 July 2024

14 July 2024

11 July 2024

2 July 2024

26 June 2024

26 April 2024

17 April 2024

4 April 2024

2 April 2024

15 March 2024

1 March 2024

4 January 2024

30 December 2023

16 August 2023

9 August 2023

21 July 2023

19 July 2023

12 May 2023

6 May 2023

6 April 2023

31 March 2023

30 March 2023

24 March 2023

23 March 2023

15 March 2023

  • curprev 05:5105:51, 15 March 2023 Freestew talk contribs m 13,554 bytes 0 tree(1) is one, tree(2) is two. It is impossible for tree(1) to be two as any second turn would contain the previous node. While tree(2) cannot be five as the longest it can go is three undo

27 February 2023

5 February 2023

2 February 2023

26 December 2022

18 December 2022

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