Skip to Main content Skip to Navigation
Journal articles

Minimal graphs for matching extensions.

Abstract : Given a positive integer n we find a graph G = (V, E) on |V | = n vertices with a minimum number of edges such that for any pair of vertices x, y with xy ∈ E the graph G−x−y contains a (almost) perfect matching M. Intuitively the non edge xy together with M form a (almost) perfect matching of G. Similarly we determine a graph G = (V, E) with a minimum number of edges such that for any matching ¯ M of the compement ¯ G of G with size n 2 − 1, G − V (¯ M) contains an edge e. Here ¯ M together with the edge e of G form a (almost) perfect matching of ¯ G. We characterize these minimum graphs for all values of n.
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download
Contributor : Marie-Christine Costa <>
Submitted on : Friday, December 9, 2016 - 2:18:35 PM
Last modification on : Monday, January 13, 2020 - 2:22:09 PM
Document(s) archivé(s) le : Thursday, March 23, 2017 - 10:26:19 AM


Files produced by the author(s)



Marie-Christine Costa, Dominique de Werra, C Picouleau. Minimal graphs for matching extensions.. Discrete Applied Mathematics, Elsevier, 2018, 234, pp.47-55. ⟨10.1016/j.dam.2015.11.007⟩. ⟨hal-01413150⟩



Record views


Files downloads