Counting bi-colored A'Campo forests

2017/02/24 by Combe, Noémie, Jugé, Vincent
#Algebraic Geometry (math.AG) #FOS: Mathematics

paper · doi:10.48550/arxiv.1702.07672

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.

Related

• Injectively k-colored rooted forests
• Counting Colored Trees
• Counting rooted forests in a network
• A Bijective Proof For Forest Reciprocity Theorem
• The game chromatic number of trees and forests