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
Showing 2021Show all

8 papers · 1 filter

math.CO2021

On -intersecting Hypergraphs with Minimum Positive Codegrees

Sam Spiro

For a hypergraph , define the minimum positive codegree to be the largest integer such that every -set which is contained in at least one e…

math.CO2021★ 1 cited

Continuously Increasing Subsequences of Random Multiset Permutations

Alexander Clifton, Bishal Deb, Yifeng Huang +2

For a word and integer , we define to be the length of the longest subsequence of the form , and we let . In this paper we esti…

math.CO2021

Saturation Problems in Convex Geometric Hypergraphs

Jason O'Neill, Sam Spiro

A convex geometric hypergraph (abbreviated cgh) consists of a collection of subsets of a strictly convex set of points in the plane. Extremal problems for cgh's have been extensive…

math.CO2021

Maximal independent sets in clique-free graphs

Xiaoyu He, Jiaxi Nie, Sam Spiro

Nielsen proved that the maximum number of maximal independent sets (MIS's) of size in an -vertex graph is asymptotic to , with the extremal construction a disjoint…

math.CO2021★ 2 cited

Linear Bounds for Cycle-free Saturation Games

Sean English, Tomáš Masařík, Grace McCourt +3

Given a family of graphs , we define the -saturation game as follows. Two players alternate adding edges to an initially empty graph on vertices, with…

math.PR2021★ 1 cited

Online Card Games

Sam Spiro

Consider the following one player game. A deck containing copies of different card types is shuffled uniformly at random. Each round the player tries to guess the next card…