SS
Sam Spiro
math.COmath.PRcs.DMmath.NTcs.ITmath.ITmath.SP
On Valency
published · living versionsW_3qer5dmp·v1 · currentpublished
Crossing numbers of complete bipartite graphs
with József Balogh, Nicholas Layman, Bernard Lidický, Florian Pfender +2
1 version
W_rzgyx8x4·v1published
Preprints & journals
54 papers in the corpus · 2017–2026Crossing numbers of complete bipartite graphs2610.25204v1 · J'ozsef Balogh, Nicholas Layman, Bernard Lidick'y et al.2026 · 3 citationsarXivon Valency
Supersaturation for Hypergraph-Weighted Independent Sets2607.14022v1 · Sam Spiro2026 · 0 citationsarXiv
Helly Theorems for Generalized Turán Problems2604.06357v1 · Sean English, Sam Spiro2026 · 0 citationsarXiv
Random Turán Problems for Graphs with a Vertex Complete to One Part2604.02264v1 · Sean Longbrake, Sam Spiro2026 · 0 citationsarXiv
Metric Dimensions of March Madness Brackets2602.06950v1 · Sam Spiro2026 · 0 citationsarXiv
Rainbow Trees in Hypercubes2508.14186v1 · Nicholas Crawford, Maya Sankar, Carl Schildkraut et al.2025 · 0 citationsarXiv
Rational Exponents for General Graphs2506.19061v1 · Sean English, Sam Spiro2025 · 0 citationsarXiv
Supersaturation of odd linear cycles2504.05116v2 · Lirong Deng, Jie Han, Jiaxi Nie et al.2025 · 0 citationsarXiv
Rainbow Erdős-Sós Conjectures2502.00135v1 · Nicholas Crawford, Dylan King, Sam Spiro2025 · 0 citationsarXivon Valency
Random Turán Problems for Expansions2412.09367v1 · Jiaxi Nie, Sam Spiro2024 · 0 citationsarXiv
On a clique-building game of Erdős2410.18304v2 · Alexandru Malekshahian, Sam Spiro2024 · 0 citationsarXiv
The Reverse Littlewood--Offord problem of Erdős2408.11034v3 · Xiaoyu He, Tomas Juskevicius, Bhargav Narayanan et al.2024 · 0 citationsarXiv
Random Turán Problems for Hypergraph Expansions2408.03406v2 · Jiaxi Nie, Sam Spiro2024 · 0 citationsarXiv
Tree Posets: Supersaturation, Enumeration, and Randomness2406.11999v3 · Tao Jiang, Sean Longbrake, Sam Spiro et al.2024 · 2 citationsarXiv
Generalized Quasikernels in Digraphs2404.07305v2 · Sam Spiro2024 · 1 citationarXiv
Clique Supersaturation2312.08265v1 · Quentin Dubroff, Benjamin Gunby, Bhargav Narayanan et al.2023 · 0 citationsarXiv
Sidorenko Hypergraphs and Random Turán Numbers2309.12873v2 · Jiaxi Nie, Sam Spiro2023 · 0 citationsarXiv
Eulerian Polynomials for Digraphs2309.07240v2 · Kyle Celano, Nicholas Sieger, Sam Spiro2023 · 0 citationsarXiv
The Random Turán Problem for Theta Graphs2305.16550v1 · Gwen McKinley, Sam Spiro2023 · 0 citationsarXiv
Triangle Percolation on the Grid2303.15402v2 · Igor Araujo, Bryce Frederickson, Robert A. Krueger et al.2023 · 0 citationsarXiv
Antichain Codes2212.08406v1 · Benjamin Gunby, Xiaoyu He, Bhargav Narayanan et al.2022 · 0 citationsarXiv
Random Polynomial Graphs for Random Turán Problems2212.08050v3 · Sam Spiro2022 · 4 citationsarXiv
Incidence-free sets and edge domination in incidence graphs2211.14339v1 · Sam Spiro, Sam Adriaensen, Sam Mattheus2022 · 1 citationarXiv
New Eigenvalue Bound for the Fractional Chromatic Number2211.04499v1 · Krystal Guo, Sam Spiro2022 · 8 citationsJ. Graph Theory 106 (2024) 167-181
Counting Deranged Matchings2211.01872v1 · Sam Spiro, Erlang Surya2022 · 3 citationsarXiv
Zero Forcing with Random Sets2208.12899v1 · Bryan Curtis, Luyining Gan, Jamie Haddock et al.2022 · 2 citationsarXiv
Semi-restricted Rock, Paper, Scissors2207.11272v1 · Sam Spiro, Erlang Surya, Ji Zeng2022 · 1 citationElectronic Journal of Combinatorics 30 (2023), P4.32
The Maximum Number of Appearances of a Word in a Grid2207.11273v1 · Gregory Patchell, Sam Spiro2022 · 0 citationsarXiv
Complementary Vanishing Graphs2207.07294v1 · Craig Erickson, Luyining Gan, Jurgen Kritschgau et al.2022 · 0 citationsarXiv
Continuously Increasing Subsequences of Random Multiset Permutations2110.10315v1 · Alexander Clifton, Bishal Deb, Yifeng Huang et al.2021 · 2 citationsarXiv
On -intersecting Hypergraphs with Minimum Positive Codegrees2110.10317v1 · Sam Spiro2021 · 2 citationsarXiv
Saturation Problems in Convex Geometric Hypergraphs2109.09931v1 · Jason O'Neill, Sam Spiro2021 · 0 citationsarXiv
Maximal independent sets in clique-free graphs2108.06359v1 · Xiaoyu He, Jiaxi Nie, Sam Spiro2021 · 0 citationsarXiv
Linear Bounds for Cycle-free Saturation Games2108.05295v1 · Sean English, Tom'as Masar'ik, Grace McCourt et al.2021 · 1 citationThe Electronic Journal of Combinatorics 29(3), 5:1-5:21, 2022
Online Card Games2106.11866v2 · Sam Spiro2021 · 2 citationsarXiv
The Wiener Index of Signed Graphs2106.11869v1 · Sam Spiro2021 · 14 citationsarXiv
A Smoother Notion of Spread Hypergraphs2106.11882v2 · Sam Spiro2021 · 7 citationsarXiv
Relative Turán Numbers for Hypergraph Cycles2012.11061v2 · Sam Spiro, Jacques Verstraete2020 · 0 citationsarXiv
Guessing about Guessing: Practical Strategies for Card Guessing with Feedback2012.04019v2 · Persi Diaconis, Ron Graham, Sam Spiro2020 · 11 citationsarXiv
Card Guessing with Partial Feedback2010.05059v2 · Persi Diaconis, Ron Graham, Xiaoyu He et al.2020 · 13 citationsCombinator. Probab. Comp. 31 (2022) 1-20
Counting Hypergraphs with Large Girth2010.01481v3 · Sam Spiro, Jacques Verstraete2020 · 7 citationsarXiv
Relative Turán Problems for Uniform Hypergraphs2009.02416v2 · Sam Spiro, Jacques Verstraete2020 · 5 citationsarXiv
Forbidding traces in triple systems2007.01827v2 · Ruth Luo, Sam Spiro2020 · 1 citationarXiv
An Averaging Processes on Hypergraphs2004.13935v3 · Sam Spiro2020 · 0 citationsarXiv
Triangle-free Subgraphs of Hypergraphs2004.10992v2 · Jiaxi Nie, Sam Spiro, Jacques Verstraete2020 · 8 citationsarXiv
Subset Parking Functions1909.10109v1 · Sam Spiro2019 · 2 citationsarXiv
Slow Recurrences1909.06517v1 · Sam Spiro2019 · 0 citationsarXiv
Counting Labeled Threshold Graphs with Eulerian Numbers1909.06518v2 · Sam Spiro2019 · 2 citationsarXiv
Slow Fibonacci Walks1903.08274v1 · Fan Chung, Ron Graham, Sam Spiro2019 · 1 citationarXiv
Random graphs induced by Catalan pairs1902.08876v1 · Daniel Kroes, Sam Spiro2019 · 0 citationsarXiv
Career total: 61 works. 54 are in this corpus.Showing the 50 most recent.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.