A new approach for the Brown-Erdos-Sos problem

arXiv2301.07758MaRDI QIDQ6423770FDOQ6423770

Authors: Asaf Shapira, Mykhaylo Tyomkyn 

Publication date: 18 January 2023

Abstract: The celebrated Brown-ErdH{o}s-S'os conjecture states that for every fixed $e$, every $3$-uniform hypergraph with $Omega(n^2)$ edges contains $e$ edges spanned by $e+3$ vertices. Up to this date all the approaches towards resolving this problem relied on highly involved applications of the hypergraph regularity method, and yet they supplied only approximate versions of the conjecture, producing $e$ edges spanned by $e+O(loge/logloge)$ vertices. In this short paper we describe a completely different approach, which reduces the problem to a variant of another well-known conjecture in extremal graph theory. A resolution of the latter would resolve the Brown-ErdH{o}s-S'os conjecture up to an absolute additive constant.

This page was built for publication: A new approach for the Brown-Erdos-Sos problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6423770)