Skip to content
Quantoros

Why is every vertex cover at least as large as every matching? Is equality automatic for all graphs?

Quant ResearchLevel: AdvancedDual combinatorial bounds

Why is every vertex cover at least as large as every matching? Is equality automatic for all graphs?

Hints
  • Use disjointness of matching edges for a lower bound.
  • Test the smallest odd cycle for equality.

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

Related questions