activity
20072026
most citedSN 2005cs in M51 II. Complete Evolution in the Optical and the Near-Infrared

258 citations · 1.3k across the 58 of their papers we have counts for

collaborators

57 papers

math.CO2026

Supersaturation for Hypergraph-Weighted Independent Sets

Sam Spiro

Many extremal problems can be viewed as finding large independent sets in an auxiliary hypergraph. We propose a generalization of this by looking for ``large'' independent sets …

math.CO2026

Helly Theorems for Generalized Turán Problems

Sean English, Sam Spiro

Given a graph and a family of graphs , the generalized Turán number is the maximum number of copies of in an -vertex $\mathca…

math.CO2026

Random Turán Problems for Graphs with a Vertex Complete to One Part

Sean Longbrake, Sam Spiro

Given a graph , the random Turán problem asks to determine the maximum number of edges in an -free subgraph of . Prior to this work, the only bipartite graphs wi…

math.CO2026

Metric Dimensions of March Madness Brackets

Sam Spiro

Say you and some friends decide to make brackets for March Madness and are told how each of your brackets scored. The question we ask is: when can you determine how the actual tour…

math.CO2025

Rainbow Trees in Hypercubes

Nicholas Crawford, Maya Sankar, Carl Schildkraut +1

We prove that every proper edge-coloring of the -dimensional hypercube contains a rainbow copy of every tree on at most edges. This result is best possible, as $Q_…

math.CO2025

Rational Exponents for General Graphs

Sean English, Sam Spiro

A rational number is a \textbf{realizable exponent} for a graph if there exists a finite family of graphs such that , whe…