The feasible region of hypergraphs
The feasible region of hypergraphs
复制标题
超图的可行域
DOI:
10.1016/j.jctb.2020.12.004
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
Mubayi, Dhruv
中科院分区:
文献类型:
--
作者:
Liu, Xizhi;Mubayi, Dhruv
Let F be a family of r-uniform hypergraphs. The feasible region Ω (F) of F is the set of points (x, y) in the unit square such that there exists a sequence of F-free r-uniform hypergraphs whose shadow density approaches x and whose edge density approaches y. The feasible region provides a lot of combinatorial information, for example, the supremum of y over all (x, y)∈ Ω (F) is the Turán density π (F), and Ω (∅) gives the Kruskal-Katona theorem. We undertake a systematic study of Ω (F), and prove that Ω (F) is completely determined by a left-continuous almost everywhere differentiable function; and moreover, there exists an F for which this function is not continuous. We also extend some old related theorems. For example, we generalize a result of Fisher and Ryan to hypergraphs and extend a classical result of Bollobás by almost completely determining the feasible region for cancellative triple systems.
登录
查看更多内容
DOI:
--
发表时间:
2019
期刊:
Comb.
影响因子:
--
作者:
Xizhi Liu;D. Mubayi
通讯作者:
D. Mubayi
DOI:
10.1016/0012-365x(92)90323-8
发表时间:
1992-05
期刊:
Discret. Math.
影响因子:
--
作者:
David C. Fisher;J. Ryan
通讯作者:
David C. Fisher;J. Ryan
DOI:
10.1016/j.jctb.2012.09.005
发表时间:
2005
期刊:
J. Comb. Theory B
影响因子:
--
作者:
O. Pikhurko
通讯作者:
O. Pikhurko
DOI:
10.1017/s0963548308009085
发表时间:
2008
期刊:
Combinatorics, Probability and Computing
影响因子:
--
作者:
A. Razborov
通讯作者:
A. Razborov
影响因子:
0.3
作者:
Hamed Hatami;S. Norin
通讯作者:
S. Norin