Professional paper

Matching in Graphs and Marriage Theorem

Antoaneta Klobučar ; Odjel za matematiku, Sveučilište u Osijeku, Osijek
Brigita Tot ; student, Odjel za matematiku, Sveučilište J.J. Strossmayera u Osijeku, Osijek

Abstract

This article describes matching in graphs, in particular in bipartite graphs. A criterium for existence of perfect matching is proved and applied to an example of matching in a group of boys and girls.

Keywords

graph; matching in graphs; bipartite graphs; Hall’s theorem

Hrčak ID:

186509

URI

https://hrcak.srce.hr/186509

Publication date:

10.7.2017.

Article data in other languages: croatian

Visits: 2.373 *