Kőnig's theorem (graph theory)

This page lists the items of the Wikipedia article Kőnig's theorem (graph theory) in their order, and the nodes of Math 2.0 that have them. The text of the article is not on this site. The items come from revision 1352721742, with the assessment C/Mid.

Outcome	Items
deferred	7
attached	2
node	1

The gap signals of the article are S1,S4,S5,S6,S8,S9.

Item	Kind	Name	Outcome	Nodes	Reason
subject	statement	Kőnig's theorem	node	Kőnig's theorem	a node has the same Wikidata item as the row
#65VI	example	Example	deferred until 2027-05-01		the cue heading names a section and not one item
#6BXH	proof	Proof using linear programming duality	attached
#COCY	example	Example	deferred until 2027-05-01		the cue heading names a section and not one item
#HNN9	statement	Theorem for vertex-weighted graphs	deferred until 2027-05-01		the heading names a part of the text and not one item
#R2ST	statement	Related theorems	deferred until 2027-05-01		the heading names a group of items
#RJTW	definition	Algorithm	deferred until 2027-05-01		the cue heading names a section and not one item
#TFEA	statement	Statement of the theorem	deferred until 2027-05-01		the cue heading names a section and not one item
#U9M0	proof	Proofs	attached
#XKXC	statement	Egerváry's theorem for edge-weighted graphs	deferred until 2027-05-01		the heading names a group of items

Refer to Wikipedia articles and their nodes for the other articles.