## Abstract

A maximum stable set in a graph G is a stable set of maximum size. S is a local maximum stable set of G, and we write S ∈ Ψ(G), if S is a maximum stable set of the subgraph spanned by S ∪ N(S), where N(S) is the neighborhood of S. A matching M is uniquely restricted if its saturated vertices induce a subgraph which has a unique perfect matching, namely M itself. Nemhauser and Trotter Jr. (Math. Programming 8(1975) 232-248), proved that any S ∈ Ψ(G) is a subset of a maximum stable set of G. In Levit and Mandrescu (Discrete Appl. Math., 124 (2002) 91-101) we have shown that the family Ψ(T) of a forest T forms a greedoid on its vertex set. In this paper, we demonstrate that for a bipartite graph G, Ψ(G) is a greedoid on its vertex set if and only if all its maximum matchings are uniquely restricted.

Original language | English |
---|---|

Pages (from-to) | 163-174 |

Number of pages | 12 |

Journal | Discrete Applied Mathematics |

Volume | 132 |

Issue number | 1-3 |

DOIs | |

State | Published - 15 Oct 2003 |

Externally published | Yes |

Event | Stability in Graphs and Related Topics - Lausanne, Switzerland Duration: 1 Jul 2002 → 1 Jul 2002 |

## Keywords

- Bipartite graph
- Local maximum stable set
- Maximum matching
- Maximum stable set
- Uniquely restricted matching Greedoid