2 papers
math.CO2022
An approach to the girth problem in cubic graphs
Aya Bernstine, Nati Linial
We offer a new, gradual approach to the largest girth problem for cubic graphs. It is easily observed that the largest possible girth of all -vertex cubic graphs is attained by…
cs.CG2021
Efficiently Enumerating Scaled Copies of Point Set Patterns
Aya Bernstine, Yehonatan Mizrahi
Problems on repeated geometric patterns in finite point sets in Euclidean space are extensively studied in the literature of combinatorial and computational geometry. Such problems…