16 citations · 37 across the 24 of their papers we have counts for
5 papers · 1 filter
Relative Turán Numbers for Hypergraph Cycles
Sam Spiro, Jacques Verstraete
For an -uniform hypergraph and a family of -uniform hypergraphs , the relative Turán number is the maximum number of edges in an…
Counting Hypergraphs with Large Girth
Sam Spiro, Jacques Verstraëte
Morris and Saxton used the method of containers to bound the number of -vertex graphs with edges containing no -cycles, and hence graphs of girth more than . We…
Relative Turán Problems for Uniform Hypergraphs
Sam Spiro, Jacques Verstraëte
For two graphs and , the relative Turán number is the maximum number of edges in an -free subgraph of . Foucaud, Krivelevich, and Perarnau \cite{FKP…
Triangle-free Subgraphs of Hypergraphs
Jiaxi Nie, Sam Spiro, Jacques Verstraete
In this paper, we consider an analog of the well-studied extremal problem for triangle-free subgraphs of graphs for uniform hypergraphs. A loose triangle is a hypergraph consis…
Tight paths in convex geometric hypergraphs
Zoltán F\" uredi, Tao Jiang, Alexandr Kostochka +2
In this paper, we prove a theorem on tight paths in convex geometric hypergraphs, which is asymptotically sharp in infinitely many cases. Our geometric theorem is a common generali…