Counting bi-colored A'Campo forests
Algebraic Geometry
2017-02-27 v1
Abstract
We give an efficient method of counting bi-colored A'Campo forests and provide a stratification criterion for the space of those graphs. We deduce an algorithm to count these forests in polynomial time, answering an open question of A'Campo.
Cite
@article{arxiv.1702.07672,
title = {Counting bi-colored A'Campo forests},
author = {Noémie Combe and Vincent Jugé},
journal= {arXiv preprint arXiv:1702.07672},
year = {2017}
}