An even-order general graph satisfies N(S)=S for every vertex set S, where neighbors may lie inside S. Does this…
Quant ResearchLevel: AdvancedScope of Hall condition
An even-order general graph satisfies |N(S)|>=|S| for every vertex set S, where neighbors may lie inside S. Does this guarantee a perfect matching?
Hints
- Try odd components whose total size is even.
- Check the neighborhood inequality inside each component.
Answer
This answer is part of mentoring
Advanced questions come with a full breakdown and a mock interview with a working quant researcher. The first call is free.
Source and licence: Oscar Levin — Discrete Mathematics: An Open Introduction, 3rd edition · CC-BY-SA-4.0 · answer: Quantoros editorial