Остановите войну!
for scientists:
default search action
Sam Spiro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j24]Sam Spiro:
Random polynomial graphs for random Turán problems. J. Graph Theory 105(2): 192-208 (2024) - 2023
- [j23]Sam Spiro, Erlang Surya, Ji Zeng:
Semi-Restricted Rock, Paper, Scissors. Electron. J. Comb. 30(4) (2023) - [j22]Sam Spiro:
A smoother notion of spread hypergraphs. Comb. Probab. Comput. 32(5): 809-818 (2023) - [j21]Jason O'Neill, Sam Spiro:
Saturation problems in convex geometric hypergraphs. Eur. J. Comb. 110: 103702 (2023) - [j20]Alexander Clifton, Bishal Deb, Yifeng Huang, Sam Spiro, Semin Yoo:
Continuously increasing subsequences of random multiset permutations. Eur. J. Comb. 110: 103708 (2023) - [j19]Sam Spiro:
On t-Intersecting Hypergraphs with Minimum Positive Codegrees. SIAM J. Discret. Math. 37(2): 675-683 (2023) - [c1]József Balogh, Bernard Lidický, Sergey Norin, Florian Pfender, Gelasio Salazar, Sam Spiro:
Crossing numbers of complete bipartite graphs. LAGOS 2023: 78-87 - 2022
- [j18]Sam Spiro:
The Wiener index of signed graphs. Appl. Math. Comput. 416: 126755 (2022) - [j17]Sean English, Tomás Masarík, Grace McCourt, Erin Meger, Michael S. Ross, Sam Spiro:
Linear Bounds for Cycle-Free Saturation Games. Electron. J. Comb. 29(3) (2022) - [j16]Persi Diaconis, Ronald L. Graham, Xiaoyu He, Sam Spiro:
Card guessing with partial feedback. Comb. Probab. Comput. 31(1): 1-20 (2022) - [j15]Xiaoyu He, Jiaxi Nie, Sam Spiro:
Maximal independent sets in clique-free graphs. Eur. J. Comb. 106: 103575 (2022) - [j14]Sam Spiro:
An averaging process on hypergraphs. J. Appl. Probab. 59(2): 495-504 (2022) - [j13]Sam Spiro, Jacques Verstraëte:
Counting hypergraphs with large girth. J. Graph Theory 100(3): 543-558 (2022) - [j12]Gregory Patchell, Sam Spiro:
The Maximum Number of Appearances of a Word in a Grid. Am. Math. Mon. 129(5): 415-434 (2022) - [j11]Persi Diaconis, Ronald L. Graham, Sam Spiro:
Guessing about Guessing: Practical Strategies for Card Guessing with Feedback. Am. Math. Mon. 129(7): 607-622 (2022) - [i2]Benjamin Gunby, Xiaoyu He, Bhargav Narayanan, Sam Spiro:
Antichain Codes. CoRR abs/2212.08406 (2022) - 2021
- [j10]Ruth Luo, Sam Spiro:
Forbidding $K_{2, t}$ Traces in Triple Systems. Electron. J. Comb. 28(2): 2 (2021) - [j9]Sam Spiro, Jacques Verstraëte:
Relative Turán numbers for hypergraph cycles. Discret. Math. 344(10): 112542 (2021) - [j8]Jiaxi Nie, Sam Spiro, Jacques Verstraëte:
Triangle-Free Subgraphs of Hypergraphs. Graphs Comb. 37(6): 2555-2570 (2021) - [j7]Sam Spiro, Jacques Verstraëte:
Relative Turán Problems for Uniform Hypergraphs. SIAM J. Discret. Math. 35(3): 2170-2191 (2021) - [i1]Sean English, Tomás Masarík, Grace McCourt, Erin Meger, Michael S. Ross, Sam Spiro:
Linear Bounds for Cycle-free Saturation Games. CoRR abs/2108.05295 (2021) - 2020
- [j6]Sam Spiro:
Counting labeled threshold graphs with Eulerian numbers. Australas. J Comb. 77: 249-255 (2020) - [j5]Sam Spiro:
Ballot permutations and odd order permutations. Discret. Math. 343(6): 111869 (2020)
2010 – 2019
- 2019
- [j4]Sam Spiro:
Saturation Games for Odd Cycles. Electron. J. Comb. 26(4): 4 (2019) - [j3]Sam Spiro:
Polynomial relations between matrices of graphs. J. Graph Theory 90(3): 288-303 (2019) - [j2]Sam Spiro:
Subset Parking Functions. J. Integer Seq. 22(7): 19.7.3 (2019) - 2017
- [j1]Attila Sali, Sam Spiro:
Forbidden Families of Minimal Quadratic and Cubic Configurations. Electron. J. Comb. 24(2): 2 (2017)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint