Deleted talk:Nash-Williams theorem

From WikiAlpha
Revision as of 17:12, 11 July 2019 by SaveArticleBot (Talk | contribs) (Via SaveArticle)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Previous Contributors

curprev 17:55, 5 May 2019‎ Michael Hardy talk contribs‎ 2,758 bytes +18‎ undo curprev 17:54, 5 May 2019‎ Michael Hardy talk contribs‎ 2,740 bytes +6‎ undo curprev 17:37, 5 May 2019‎ Michael Hardy talk contribs‎ m 2,734 bytes 0‎ Michael Hardy moved page Nash-Williams Theorem to Nash-Williams theorem undo curprev 17:36, 5 May 2019‎ Michael Hardy talk contribs‎ 2,734 bytes +96‎ undo curprev 17:03, 4 May 2019‎ Alexkyoung talk contribs‎ 2,638 bytes -21‎ undo Tag: Visual edit: Switched curprev 17:03, 4 May 2019‎ Alexkyoung talk contribs‎ 2,659 bytes 0‎ categorized undo Tag: Visual edit curprev 15:47, 4 May 2019‎ Bearcat talk contribs‎ 2,659 bytes +46‎ uncategorized undo Tag: AWB curprev 12:27, 4 May 2019‎ Rubbish computer talk contribs‎ m 2,613 bytes +1‎ →‎Nash-Williams Theorem for forests: typo fixing, typo(s) fixed: In other words → In other words, undo Tag: AWB curprev 21:16, 3 May 2019‎ Alexkyoung talk contribs‎ 2,612 bytes -7‎ →‎Arboricity and generalization to forests: title change undo Tag: Visual edit curprev 21:11, 3 May 2019‎ Alexkyoung talk contribs‎ 2,619 bytes +932‎ →‎Arboricity and generalization to forests: more info undo Tag: Visual edit curprev 20:46, 3 May 2019‎ Alexkyoung talk contribs‎ 1,687 bytes +26‎ link undo Tag: Visual edit curprev 20:44, 3 May 2019‎ Alexkyoung talk contribs‎ 1,661 bytes +595‎ added second NW theorem undo Tag: Visual edit curprev 20:28, 3 May 2019‎ Alexkyoung talk contribs‎ 1,066 bytes +1,066‎ ←Created page with 'In graph theory, the '''Nash-Williams Theorem''' is a '''tree-packing''' theorem that describes how many edge-disjoint spanning trees a...' Tag: Visual edit