272

OverviewVersionsHelp

Here you can see all page revisions and compare the changes have been made in each revision. Left column shows the page title and transcription in the selected revision, right column shows what have been changed. Unchanged text is highlighted in white, deleted text is highlighted in red, and inserted text is highlighted in green color.

2 revisions
laika at May 11, 2018 02:14 PM

272

26

we have a right to transform M into N in the graph just written, where it occurs under one hundred enclosures.

Therefore if Right No 1 holds good for disconnected graphs withing any even number of enclosures up to any number, it holds good also for the next higher even number of enclosures.
But we have alreadyproved it for 0 and for 2 enclosures, and therefore it holds good for any even number of enclosures that can be reached by sucessive additions of 2.

272