12 citations · 71 across the 46 of their papers we have counts for
9 papers · 1 filter
Few copies in -saturated graphs
Jürgen Kritschgau, Abhishek Methuku, Michael Tait +1
A graph is -saturated if it is -free but the addition of any edge creates a copy of . In this paper we study the quantity which denotes the minimum…
Rainbow numbers for in
Erin Bevilacqua, Samuel King, Jürgen Kritschgau +3
In this work, we investigate the fewest number of colors needed to guarantee a rainbow solution to the equation in . This value is called the Rain…
Sidon sets and 2-caps in
Yixuan Huang, Michael Tait, Robert Won
For each natural number , we introduce the concept of a -cap in . A subset of is called a -cap if, for each , no …
Linearity of Saturation for Berge Hypergraphs
Sean English, Dániel Gerbner, Abhishek Methuku +1
For a graph , we say a hypergraph is Berge- if it can be obtained from be replacing each edge of with a hyperedge containing it. We say a hypergraph is Berge--…
Hypergraphs with few Berge paths of fixed length between vertices
Zhiyang He, Michael Tait
In this paper we study the maximum number of hyperedges which may be in an -uniform hypergraph under the restriction that no pair of vertices has more than Berge paths of le…
Turán numbers of theta graphs
Boris Bukh, Michael Tait
The theta graph consists of two vertices joined by vertex-disjoint paths of length each. For fixed odd and large , we show that the largest graph…