On product representations of powers, I
European Journal of Combinatorics
C6-free bipartite graphs and product representation of squares
Proceedings of an international symposium on Graphs and combinatorics
Codes with girth 8 Tanner graph representation
Designs, Codes and Cryptography
| Hi-index | 0.00 |
In this paper, 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.