Chase A. Wilson

collaborators

2 papers

math.CO2025

Independent Sets in Hypergraphs

Jacques Verstraete, Chase Wilson

A theorem of Shearer states that every $n$ -vertex triangle-free graph of maximum degree $d \geq 2$ contains an independent set of size at least $(d\log d - d + 1)/(d - 1)^2 \cdot n…

math.NT2025

An analogue of the Herbrand-Ribet theorem in graph theory

Daniel ValliÃ¨res, Chase A. Wilson

We study an analogue of the Herbrand-Ribet theorem, and its refinement by Mazur and Wiles, in graph theory. For an odd prime number $p$ , we let $F_{p}$ and $\mathbb{Z}_{p}…