加载中…
Given a hypergraph and a graph , we say that is a - if there is a bijection between the hyperedges of and the edges of such that each hyperedge contains its image. We denote by the largest number of hyperedges in a -uniform Berge--free graph. Let denote the largest number of copies of in -vertex -free graphs. It is known that , thus if , then . We conjecture that in this case. We prove this conjecture in several instances, including the cases and . We prove the general bound .

生成讲解博客的中文版本

生成AI智能校验的中文版本