Counting bi-colored A'Campo forests
classification
🧮 math.AG
keywords
campoforestsbi-coloredcountingalgorithmansweringcountcriterion
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.