Let H be a set of connected graphs. A graph is said to be H-free if it does not contain any member of H as an induced subgraph. Plummer and Saito [J Graph Theory 50 (2005), 1-12] and Fujita et al. [J Combin Theory Ser B 96 (2006), 315-324] characterized all H with |H| β€ 2 such that every connected H
A compactness result for perfect matchings
β Scribed by Norbert Polat
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 537 KB
- Volume
- 64
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
We show that an infinite set system (V, ~g), for which ~ is a subspace of the vector space of all finite subsets of V, has a perfect matching if and only if every finite subset of V is covered by a matching of (V, ~).
π SIMILAR VOLUMES
In classical rook theory there is a fundamental relationship between the rook numbers and the hit numbers relative to any board. In that theory the k-th hit number of a board B can be interpreted as the number of permutations whose intersection with B is of size k. In the case of Ferrers boards ther
The Final Book in the McCabe series.Craig McCabe is on his way back to Gleann when he is attacked and badly injured. He knows his only chance at survival is to make his way to his granddaβs hunting lodge where heβll find food, shelter, and some healing supplies.Peigi Farland has run away from her fa
The news rocked the town. A woman's body found in a boathouse. And the woman's last known companion Missing Presumed Fled. To the people of Stansfield it's an open and shut case. But Detective Inspector Lloyd - teamed up once more with Sergeant Judy Hill - isn't so quick to jump to conclusions. To