12 citations · 71 across the 46 of their papers we have counts for
4 papers · 1 filter
On a colored Turán problem of Diwan and Mubayi
Ander Lamaison, Alp Müyesser, Michael Tait
Suppose that (red) and (blue) are two graphs on the same vertex set of size , and is some graph with a red-blue coloring of its edges. How large can and be i…
Regular Turán numbers of complete bipartite graphs
Michael Tait, Craig Timmons
Let denote the maximum number of edges in an -vertex graph that is regular and does not contain as a subgraph. We give lower bounds on $\mathrm{rex}(n,…
Turán and Ramsey-type results for unavoidable subgraphs
Alp Müyesser, Michael Tait
We study Turán and Ramsey-type problems on edge-colored graphs. An edge-colored graph is called {\em -balanced} if each color class contains at least an -…
Improved bounds on sizes of generalized caps in
Michael Tait, Robert Won
An -general set in is a set of points such that any subset of size is in general position. A -general set is often called a capset. In this paper, we study the…