A short proof of König's matching theorem

Rizzi, Romeo (1999) A short proof of König's matching theorem. UNSPECIFIED.

[img]
Preview
 PDF
Download (150Kb) | Preview

    Abstract

    We give a short proof of the following basic fact in matching theory: in a bipartite graph the maximum size of a matching equals the minimum size of a node cover.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA075 Electronic computers. Computer science
    Uncontrolled Keywords: bipartite graphs, maximum matching, minimum node cover
    Additional Information: Published in: "Journal of Graph Theory", vol. 33 (3) (2000) 138--139.
    Report Number: DIT-02-054
    Repository staff approval on: 21 Jan 2003

    Actions (login required)

    		 View Item