# 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 18441: Counting n−1 Edges Alone Does Not Establish a Tree

- ID: `q-20261014-advance-20261104-r06-spanning-tree-0041`; number: 18441
- Processing: second_context_reviewed
- MKO: [mko-spanning-tree](/en/mko/mko-spanning-tree/)
- Family: [qf-mod35-spantree-n-minus-one-certificate](/en/explore/?family=qf-mod35-spantree-n-minus-one-certificate)
- Batch: [batch-20261014-advance-20261104-r06-spanning-tree-foundations](/en/explore/?batch=batch-20261014-advance-20261104-r06-spanning-tree-foundations)
- [Derivation](/en/questions/q-20261014-advance-20261104-r06-spanning-tree-0041/) / [Markdown](/en/questions/q-20261014-advance-20261104-r06-spanning-tree-0041/index.md) / [JSON](/data/question-derivations/questions/q-20261014-advance-20261104-r06-spanning-tree-0041.json)