A Brief Survey of König-Egerváry Graphs

Pete Kinnecom

Document Type

Presentation Abstract

Presentation Date

5-4-2010

Abstract

König-Egerváry graphs are the class of graphs where the size of a minimum vertex cover equals the size of a maximum matching. In this paper we examine various characterizations, combinatorial properties, and algorithmic aspects of König-Egerváry graphs. For my talk, I will be presenting a characterization proved by C. Larson in 2009. We will show that a graph is König-Egerváry if and only if the size of a maximum critical independent set is equal to the size of a maximum independent set.

Additional Details

Presentation of Master’s Project

Tuesday, May 4, 2010
2:10 pm in Math 108

This document is currently not available here.

Share

COinS