Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Visit our COVID-19 information website to learn how Warriors protect Warriors.
Please note: The University of Waterloo is closed for all events until further notice.
Speaker: | Nishad Kothari |
---|---|
Affiliation: | University of Waterloo |
Room: | Mathematics and Computer Building (MC) 5168 |
A connected graph is called matching-covered if each edge lies in a perfect matching. A classical result of Lovasz (1983) states that every nonbipartite matching covered graph either "contains" $K_4$, or "contains" the triangular prism (complement of a 6-cycle). Carvalho and Lucchesi (1996) gave a much simpler proof of this fundamental and very useful result. I will present their proof. I will also present an application due to Lovasz, which gives a different characterization of graphs with the Konig property (size of max. matching = size of min. vertex cover).
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land granted to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is centralized within our Indigenous Initiatives Office.