Kőnig's theorem (graph theory): Revision history

7 January 2009

• curprev 20:3020:30, 7 January 2009 Miym talk contribs 12,905 bytes +33 maximal -> maximum, minimal -> minimum undo

15 December 2008

• curprev 20:5720:57, 15 December 2008 Citation bot talk contribs m 12,872 bytes −1 Updating page numbers after recent improvement to Template:Cite book. Added: page. Formatted: pages. undo

14 December 2008

• curprev 15:3215:32, 14 December 2008 Citation bot talk contribs m 12,873 bytes −6 Citation maintenance. Removed redundant parameters. You can use this bot yourself! Please report any bugs. undo

5 October 2008

• curprev 21:5221:52, 5 October 2008 SmackBot talk contribs m 12,879 bytes −1 fix defaultsort undo

30 September 2008

• curprev 23:5223:52, 30 September 2008 Useight talk contribs m 12,880 bytes +12,816 Reverted edits by 65.96.75.157 to last version by 87.78.70.255 (HG) undo
• curprev 23:5223:52, 30 September 2008 65.96.75.157 talk 64 bytes −12,816 ←Replaced content with 'It's really confusing and don't even try to learn it. Trust me.' undo

21 September 2008

• curprev 13:4413:44, 21 September 2008 87.78.70.255 talk 12,880 bytes +5 →Proof: A matching edge can also be in S_(2j+1), think of a line of vertices, where the middle edge is matched. undo

4 July 2008

• curprev 22:4922:49, 4 July 2008 David Eppstein talk contribs m 12,875 bytes +28 +cat undo

10 June 2008

• curprev 19:1719:17, 10 June 2008 Eubot talk contribs 12,847 bytes −17 Hatnote formatting, see User:Eubot/Hatnote formatting undo

29 May 2008

• curprev 14:1014:10, 29 May 2008 DOI bot talk contribs m 12,864 bytes +29 Citation maintenance. Initiated by tarun2k. You can use this bot yourself! Please report any bugs. undo

16 May 2008

• curprev 11:1211:12, 16 May 2008 Michael Slone talk contribs 12,835 bytes +603 revert; this removes a lot of text and is not correctly capitalized or punctuated undo

5 May 2008

• curprev 13:5513:55, 5 May 2008 203.99.173.183 talk 12,232 bytes −603 →Example undo

5 April 2008

• curprev 10:2510:25, 5 April 2008 83.155.219.40 talk 12,835 bytes +51 No edit summary undo

24 March 2008

• curprev 17:0417:04, 24 March 2008 Giftlite talk contribs m 12,784 bytes +6 →Example: +above undo
• curprev 15:1815:18, 24 March 2008 24.3.19.192 talk 12,778 bytes +178 →Algorithm undo

23 February 2008

• curprev 14:3114:31, 23 February 2008 88.209.195.215 talk 12,600 bytes +5 improved wording of second sentence of second paragraph undo

16 December 2007

• curprev 20:2020:20, 16 December 2007 David Eppstein talk contribs m 12,595 bytes +40 +cat undo

10 November 2007

• curprev 11:0211:02, 10 November 2007 PixelBot talk contribs m 12,555 bytes +40 robot Adding: de:Satz von König (Graphentheorie) undo

3 September 2007

• curprev 11:2211:22, 3 September 2007 146.141.15.34 talk 12,515 bytes +4 →Algorithm undo
• curprev 11:1711:17, 3 September 2007 146.141.15.34 talk 12,511 bytes +575 →Proof undo
• curprev 11:0211:02, 3 September 2007 146.141.15.34 talk 11,936 bytes +124 →Setting undo

20 July 2007

• curprev 12:4212:42, 20 July 2007 141.35.12.61 talk 11,812 bytes +170 →Proof: add missing case undo

30 June 2007

• curprev 22:0822:08, 30 June 2007 David Eppstein talk contribs 11,642 bytes +334 Mention Steinitz in connection with matching in regular bipartite graphs undo

14 June 2007

• curprev 03:4503:45, 14 June 2007 Cronholm144 talk contribs 11,308 bytes −1 clean up and/or add/rm math rating template using AWB undo

30 May 2007

• curprev 22:1222:12, 30 May 2007 David Eppstein talk contribs m 11,309 bytes 0 vectorize illustrations and fix missing edge in one of them (as noted by Jokes Free4Me) undo

28 May 2007

• curprev 19:2519:25, 28 May 2007 David Eppstein talk contribs m 11,309 bytes +3 Oops, never mind. Your change is correct. It's only matched edges we're talking about here. undo
• curprev 19:2419:24, 28 May 2007 David Eppstein talk contribs 11,306 bytes −3 No, "if" is correct. The other endpoint could belong instead to S_{2j+1}; this happens e.g. for S_3 in the example. undo
• curprev 19:1119:11, 28 May 2007 Jokes Free4Me talk contribs m 11,309 bytes +3 →Proof: changed condition to fact undo
• curprev 18:3618:36, 28 May 2007 David Eppstein talk contribs m 11,306 bytes −3 →Theorem's statement: should be "cardinality" (noun) not "cardinal" (adjective), but I think it can be expressed more clearly without either undo
• curprev 17:5417:54, 28 May 2007 Jokes Free4Me talk contribs m 11,309 bytes +177 added theorem statement , added section title for the settings of the notions undo

5 May 2007

• curprev 14:5214:52, 5 May 2007 Da Joe talk contribs 11,132 bytes +37 +hu undo

15 December 2006

• curprev 11:2411:24, 15 December 2006 152.66.242.213 talk 11,095 bytes +1 correcting the reference titles in hungarian undo

13 December 2006

• curprev 18:5118:51, 13 December 2006 David Eppstein talk contribs m 11,094 bytes +662 rv damage undo
• curprev 18:3918:39, 13 December 2006 203.162.3.145 talk 10,432 bytes −662 →Example undo

4 December 2006

• curprev 16:4616:46, 4 December 2006 David Eppstein talk contribs m 11,094 bytes +2 fix Gene's illliterate missorting undo
• curprev 09:3109:31, 4 December 2006 Gene Nygaard talk contribs 11,092 bytes +32 fix missorting undo
• curprev 07:4407:44, 4 December 2006 David Eppstein talk contribs m 11,060 bytes +117 →References: MR and DOI links undo

30 November 2006

• curprev 04:3604:36, 30 November 2006 Mhym talk contribs 10,943 bytes +36 +ru undo

26 October 2006

• curprev 04:1904:19, 26 October 2006 David Eppstein talk contribs m 10,907 bytes −17 →Connections with perfect graphs: avoid "it is known that" circumlocution undo
• curprev 04:0904:09, 26 October 2006 David Eppstein talk contribs m 10,924 bytes 0 authorlinks undo
• curprev 03:5703:57, 26 October 2006 David Eppstein talk contribs 10,924 bytes +153 Spell Kőnig's name as the Hungarians do. But leave the theorem itself with its usual spelling. undo
• curprev 03:4103:41, 26 October 2006 David Eppstein talk contribs m 10,771 bytes +13 →References: unabbreviate journal undo
• curprev 00:2100:21, 26 October 2006 David Eppstein talk contribs m 10,758 bytes +41 →Connections with perfect graphs: more explicitness about which graph is which undo
• curprev 00:0600:06, 26 October 2006 David Eppstein talk contribs m 10,717 bytes +51 →Connections with perfect graphs: a little clearer which construction belongs to which graph undo
• curprev 00:0500:05, 26 October 2006 David Eppstein talk contribs m 10,666 bytes −7 →Connections with perfect graphs: grammar undo
• curprev 00:0300:03, 26 October 2006 David Eppstein talk contribs 10,673 bytes +3,165 →Connections with perfect graphs undo

25 October 2006

• curprev 22:5122:51, 25 October 2006 David Eppstein talk contribs 7,508 bytes +279 →Proof: be a little more careful about the partition process undo
• curprev 22:4222:42, 25 October 2006 David Eppstein talk contribs 7,229 bytes +2,965 →Proof: with illustration undo
• curprev 20:3520:35, 25 October 2006 David Eppstein talk contribs 4,264 bytes +1,578 →References: ... and eponym. Destub although I have plenty more to add. undo
• curprev 19:5619:56, 25 October 2006 David Eppstein talk contribs 2,686 bytes +824 →Example: (and illustration) undo