2 citations · 2 across the 1 of their papers we have counts for
1 paper
Sage DuBose, Daniel Vallières
Let ℓ be a rational prime. We show that an analogue of a conjecture of Greenberg in graph theory holds true. More precisely, we show that when n is sufficiently large, the $…