关于一致超图的导出婚配可扩张性.pdfVIP

 H  H M Æ H | V (M ) = M M H H H  H  n Æ (1) : |X (H )| rn + r ; (2) : H (3) : H M |M | = n H M ∗ M ⊆ M ∗  - n K.Cameron M.D.Plummer [4] [3]  [6],[7],[8],[9],[10],[11],[15],[16],[18],[19]  () Æ (1): H  |X (H )| r n 2 |X (H )|  r H  n II H  (n − 1) (2): H  n H M |M | n H  (3): H  X Æ X ∗ ⊂ X, Y ∗ ⊂ X, X ∗ ∪ Y ∗ ∈ H, Æ d(x) = 2, d(y) = 2, x, y , ∗ ∗ x ∈ X , y ∈ Y H ∗ ∗  X \(X ∪Y ) (4): H r , Kr  r n n = rk , k H × Kr  n (5): k1 k2  H1 H2  k1 k2 H1 × H2  k1 + k2 + 1 : III English Abstract Hypergraphs considered here are finite and simple. Given a simple hypergraph H , a matching M of H is an induced matching in H if it satisfies: H | V (M ) = M , especially, if every induced matching of H is included in a perfect matching of H , so we say that H is induced matching extendable. that is IM-extendable. Furthermore, we say a connected hypergraph is n extendable if it satisfies: (1) : |X (H )| rn + r ; (2) : H has perfect matchings;