Triangle-free hypergraphs. (English) Zbl 1082.05064
Summary: We give sharp upper bounds on the maximum number of edges in very unbalanced bipartite graphs not containing any cycle of length 6. To prove this, we estimate roughly the sum of the sizes of the hyperedges in triangle-free multi-hypergraphs.
MSC:
05C65 | Hypergraphs |