Back to Search
Start Over
Triangle-Free Hypergraphs
- Source :
- Combinatorics, Probability and Computing; January 2006, Vol. 15 Issue: 1-2 p185-191, 7p
- Publication Year :
- 2006
-
Abstract
- 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.
Details
- Language :
- English
- ISSN :
- 09635483 and 14692163
- Volume :
- 15
- Issue :
- 1-2
- Database :
- Supplemental Index
- Journal :
- Combinatorics, Probability and Computing
- Publication Type :
- Periodical
- Accession number :
- ejs8221318
- Full Text :
- https://doi.org/10.1017/S0963548305007108