Name
Abstract | ||
|---|---|---|
In this note we asymptotically determine the maximum number of hyperedges possible in an r-uniform, connected n-vertex hypergraph without a Berge path of length k, as n and k tend to infinity. We show that, unlike in the graph case, the multiplicative constant is smaller with the assumption of connectivity. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.disc.2018.06.006 | Discrete Mathematics |
Keywords | Field | DocType |
Connected,Erdős–Gallai,Berge hypergraph | Discrete mathematics,Graph,Combinatorics,Multiplicative function,Constraint graph,Hypergraph,Infinity,Mathematics | Journal |
Volume | Issue | ISSN |
341 | 9 | 0012-365X |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ervin Györi | 1 | 88 | 21.62 |
| Abhishek Methuku | 2 | 18 | 9.98 |
| Nika Salia | 3 | 0 | 0.68 |
| Casey Tompkins | 4 | 4 | 2.48 |
| Máté Vizer | 5 | 27 | 14.06 |