Avoiding long Berge cycles II, exact bounds for all $n$
Work
Year: 2021
Type: article
Abstract: Let $EG_r(n,k)$ denote the maximum number of edges in an $n$-vertex $r$-uniform hypergraph with no Berge cycles of length $k$ or longer. In the first part of this work, we have found exact values of $... more
Source: Journal of Combinatorics
Cites:
Cited by:
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green