No CrossRef data available.
Article contents
Triangle-Free Hypergraphs
Published online by Cambridge University Press: 03 January 2006
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.
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.
Information
- Type
- Paper
- Information
- Copyright
- 2006 Cambridge University Press
You have
Access
- 34
- Cited by