Hypergraphs with irrational Tur\'an density and many extremal configurations
Abstract
Unlike graphs, determining Tur\'an densities of hypergraphs is known to be notoriously hard in general. The essential reason is that for many classical families of r-uniform hypergraphs F, there are perhaps many near-extremal Mt-free configurations with very different structure. Such a phenomenon is called not stable, and Liu and Mubayi gave a first not stable example. Another perhaps reason is that little is known about the set consisting of all possible Tur\'an densities which has cardinality of the continuum. Let t 2 be an integer. In this paper, we construct a finite family Mt of 3-uniform hypergraphs such that the Tur\'an density of Mt is irrational, and there are t near-extremal Mt-free configurations that are far from each other in edit-distance. This is the first not stable example that has an irrational Tur\'an density. It also provides a new phenomenon about feasible region functions.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.