Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1017/S0963548305007108 | Combinatorics, Probability & Computing |
Keywords | Field | DocType |
unbalanced bipartite graph,sharp upper bound,maximum number,triangle-free hypergraphs,triangle-free multi-hypergraphs | Discrete mathematics,Combinatorics,Constraint graph,Bipartite graph,Mathematics | Journal |
Volume | Issue | Citations |
15 | 1-2 | 5 |
PageRank | References | Authors |
1.02 | 2 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ervin Györi | 1 | 88 | 21.62 |