On matching extensions with prescribed and proscribed edge sets. II (Q1292810)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On matching extensions with prescribed and proscribed edge sets. II |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On matching extensions with prescribed and proscribed edge sets. II |
scientific article |
Statements
On matching extensions with prescribed and proscribed edge sets. II (English)
0 references
25 January 2000
0 references
A graph \(G\) is said to be \(E(m,n)\) if for every pair of disjoint matchings \(M,N\subseteq E(G)\) of size \(m\) and \(n\), respectively, there is a perfect matching \(F\) in \(G\) such that \(M\subseteq F\) and \(F\cap N=\varnothing\). The paper studies conditions under which the implication \(E(m,n)\to E(p,q)\) does or does not hold. It extends the previous results on claw-free graphs and bipartite graphs.
0 references
perfect matching
0 references
claw-free graphs
0 references
bipartite graphs
0 references
