Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-23T13:36:02.087Z Has data issue: false hasContentIssue false
  • English
  • Français

Triangle-Free Hypergraphs

Published online by Cambridge University Press:  03 January 2006

ERVIN GYŐRI
ERVIN GYŐRI
Affiliation:
Alfréd Rényi Institute of Mathematics, Budapest, Hungary (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

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.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 15 , Issue 1-2 , January 2006 , pp. 185 - 191
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)