A. Sanitt

collaborators

2 papers

math.CO2021

The density Turán problem for hypergraphs

Adam Sanitt, John Talbot

Given a $k$ -graph $H$ a complete blow-up of $H$ is a $k$ -graph $H^$ formed by replacing each $v \in V (H)$ by a non-empty vertex class $A_{v}$ and then inserting all edges between…

math.CO2015

An exact Turán result for tripartite 3-graphs

Adam Sanitt, John Talbot

Mantel's theorem says that among all triangle-free graphs of a given order the balanced complete bipartite graph is the unique graph of maximum size. We prove an analogue of this r…