# OCME · Knowledge & practice explorer

302 MKO / 1,441 families / 360 batches / 36,000 questions.

36,000 second-context math/bilingual reviewed; 0 display/symbol-checked candidates. Source questions: candidate. English: ai_candidate. No new proof, Lean, SREG or training.

1 results; page 1/1.

## Question 26003: Edgeless Graphs Have the Unique Empty Minimum Cover; Other Graphs May Have Several

- ID: `q-20261015-advance-20261115-r06-minimum-vertex-cover-0078`; number: 26003
- Processing: second_context_reviewed
- MKO: [mko-minimum-vertex-cover](/en/mko/mko-minimum-vertex-cover/)
- Family: [qf-mod46-mincover-empty-multiple-boundary](/en/explore/?family=qf-mod46-mincover-empty-multiple-boundary)
- Batch: [batch-20261015-advance-20261115-r06-minimum-vertex-cover-foundations](/en/explore/?batch=batch-20261015-advance-20261115-r06-minimum-vertex-cover-foundations)
- [Derivation](/en/questions/q-20261015-advance-20261115-r06-minimum-vertex-cover-0078/) / [Markdown](/en/questions/q-20261015-advance-20261115-r06-minimum-vertex-cover-0078/index.md) / [JSON](/data/question-derivations/questions/q-20261015-advance-20261115-r06-minimum-vertex-cover-0078.json)