English

Hypergraphs with irrational Tur\'{a}n density and many extremal configurations

Combinatorics 2023-12-03 v1

Abstract

Unlike graphs, determining Tur\'{a}n densities of hypergraphs is known to be notoriously hard in general. The essential reason is that for many classical families of rr-uniform hypergraphs F\mathcal{F}, there are perhaps many near-extremal Mt\mathcal{M}_t-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\'{a}n densities which has cardinality of the continuum. Let t2t\ge 2 be an integer. In this paper, we construct a finite family Mt\mathcal{M}_t of 3-uniform hypergraphs such that the Tur\'{a}n density of Mt\mathcal{M}_t is irrational, and there are tt near-extremal Mt\mathcal{M}_t-free configurations that are far from each other in edit-distance. This is the first not stable example that has an irrational Tur\'{a}n density. It also provides a new phenomenon about feasible region functions.

Keywords

Cite

@article{arxiv.2308.09382,
  title  = {Hypergraphs with irrational Tur\'{a}n density and many extremal configurations},
  author = {Jianfeng Hou and Heng Li and Guanghui Wang and Yixiao Zhang},
  journal= {arXiv preprint arXiv:2308.09382},
  year   = {2023}
}

Comments

arXiv admin note: text overlap with arXiv:2206.03948

R2 v1 2026-06-28T11:58:32.125Z