2 citations · 3 across the 9 of their papers we have counts for
15 papers · 1 filter
Colorful Helly via induced matchings
Cosmin Pohoata, Kevin Yang, Shengtong Zhang
We establish a theorem regarding the maximum size of an {\it{induced}} matching in the bipartite complement of the incidence graph of a set system . We show that t…
Even cycles in graphs avoiding longer even cycles
David Conlon, Eion Mulrenin, Cosmin Pohoata
A conjecture of Verstraëte states that for any fixed there exists a positive constant such that any -free graph contains a -free subgraph with…
Norm hypergraphs
Cosmin Pohoata, Dmitriy Zakharov
We introduce a high uniformity generalization of the so-called (projective) norm graphs of Alon, Kollár, Rónyai, and Szabó, and use it to show that $$\operatorname{ex}_{d}(n,K_{s_{…
Random multilinear maps and the Erdős box problem
David Conlon, Cosmin Pohoata, Dmitriy Zakharov
By using random multilinear maps, we provide new lower bounds for the Erdős box problem, the problem of estimating the extremal number of the complete -partite -uniform hyper…
On the Zarankiewicz problem for graphs with bounded VC-dimension
Oliver Janzer, Cosmin Pohoata
The problem of Zarankiewicz asks for the maximum number of edges in a bipartite graph on vertices which does not contain the complete bipartite graph as a subgraph. A…
A remark on sets with few distances in
Fedor Petrov, Cosmin Pohoata
A celebrated theorem due to Bannai-Bannai-Stanton says that if is a set of points in , which determines distinct distances, then $$|A| \leq {d+s \choose s}.…