Submission date: 2 NOvember 2021

Abstract:

Over the past several years, numerous authors have explored model theoretically motivated combinatorial conditions that ensure that a graph has an efficient regular decomposition, in the sense of Szemer\'edi. In this paper we set out a research program that explores a corresponding set of questions for 3-uniform hypergraphs.
A detailed abstract appears in the document.

Mathematics Subject Classification:

Keywords and phrases:

Full text arXiv 2111.01737: pdf, ps.