Problemresearch
Maximum agreement forest
Also called MAF.
Partition the leaves into fewest components so that the two trees agree on each component.
Partition the leaves into fewest components so that the two trees agree on each component.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag Q297EA Edit this page History Report an error