2 papers
math.CO2026
Cycles with almost linearly many chords
Nemanja DraganiÄ, António Girão
We prove that constant minimum degree already forces cycles with almost linearly many chords. Specifically, every graph with contains a cycle of length …
math.LO2025
Measurable one-ended spanning trees
Matt Bowen, António Girão, Héctor Jardón-Sánchez +1
We show that a one-ended, locally finite, measurable graph on a standard probability space admits a measurable one-ended spanning subtree if and only if it is measure-hyperfinite.…