Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Zamagias, Eleni"'
Autor:
Billings, W. Zane, Clifton, Justin, Hiller, Josh, Meek, Tommy, Penland, Andrew, Rogers, Wesley, Smokovich, Gabriella, Vasquez-Berroteran, Andrew, Zamagias, Eleni
We present a recursive formula for the number of ways to color $j$ vertices blue in an r-uniform hyperpath of size $n$ while avoiding a blue monochromatic sub-hyperpath of length k. We use this result to solve the corresponding problem for $(r-1)$-ti
Externí odkaz:
http://arxiv.org/abs/2003.00035
