English

On the existence of dense substructures in finite groups

Combinatorics 2019-02-22 v1

Abstract

Fix k6k \geq 6. We prove that any large enough finite group GG contains kk elements which span quadratically many triples of the form (a,b,ab)S×G(a,b,ab) \in S \times G, given any dense set SG×GS \subseteq G \times G. The quadratic bound is asymptotically optimal. In particular, this provides an elementary proof of a special case of a conjecture of Brown, Erd\H{o}s and S\'{o}s. We remark that the result was recently discovered independently by Nenadov, Sudakov and Tyomkyn.

Keywords

Cite

@article{arxiv.1902.07819,
  title  = {On the existence of dense substructures in finite groups},
  author = {Ching Wong},
  journal= {arXiv preprint arXiv:1902.07819},
  year   = {2019}
}