The following pages link to Sam Spiro (Q2004950):
Displaying 40 items.
- Slow recurrences (Q2004951) (← links)
- Relative Turán numbers for hypergraph cycles (Q2043404) (← links)
- Triangle-free subgraphs of hypergraphs (Q2053717) (← links)
- The Wiener index of signed graphs (Q2060215) (← links)
- Random graphs induced by Catalan pairs (Q2073646) (← links)
- Online card games (Q2136089) (← links)
- Linear bounds for cycle-free saturation games (Q2153400) (← links)
- Ballot permutations and odd order permutations (Q2174607) (← links)
- Slow Fibonacci walks (Q2291703) (← links)
- Saturation games for odd cycles (Q2327225) (← links)
- Forbidden families of minimal quadratic and cubic configurations (Q2363111) (← links)
- Forbidding \(K_{2,t}\) traces in triple systems (Q2662345) (← links)
- Maximal independent sets in clique-free graphs (Q2674559) (← links)
- Saturation problems in convex geometric hypergraphs (Q2701003) (← links)
- Continuously increasing subsequences of random multiset permutations (Q2701010) (← links)
- Counting Labeled Threshold Graphs with Eulerian Numbers (Q3300701) (← links)
- Polynomial relations between matrices of graphs (Q4629997) (← links)
- The Maximum Number of Appearances of a Word in a Grid (Q5075871) (← links)
- An averaging process on hypergraphs (Q5087003) (← links)
- Guessing about Guessing: Practical Strategies for Card Guessing with Feedback (Q5094534) (← links)
- Relative Turán Problems for Uniform Hypergraphs (Q5157384) (← links)
- Subset Parking Functions (Q5241190) (← links)
- Card guessing with partial feedback (Q5886303) (← links)
- Counting hypergraphs with large girth (Q6081555) (← links)
- On <i>t</i>-Intersecting Hypergraphs with Minimum Positive Codegrees (Q6101018) (← links)
- Incidence‐free sets and edge domination in incidence graphs (Q6121301) (← links)
- Antichain codes (Q6139014) (← links)
- Random polynomial graphs for random Turán problems (Q6143381) (← links)
- New eigenvalue bound for the fractional chromatic number (Q6201030) (← links)
- Zero forcing with random sets (Q6204353) (← links)
- Complementary Vanishing Graphs (Q6405051) (← links)
- Triangle Percolation on the Grid (Q6509369) (← links)
- Generalized Quasikernels in Digraphs (Q6530084) (← links)
- Counting deranged matchings (Q6568854) (← links)
- A smoother notion of spread hypergraphs (Q6632778) (← links)
- Tree Posets: Supersaturation, Enumeration, and Randomness (Q6732972) (← links)
- Random Turán Problems for Hypergraph Expansions (Q6739539) (← links)
- The Reverse Littlewood--Offord problem of Erdős (Q6741141) (← links)
- On a clique-building game of Erdős (Q6750165) (← links)
- Random Turán Problems for $K_{s,t}$ Expansions (Q6757840) (← links)
