Name
Abstract | ||
|---|---|---|
Let F be a graph. A hypergraph is called Berge-F if it can be obtained by replacing each edge in F by a hyperedge containing it. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.jctb.2019.01.001 | Journal of Combinatorial Theory, Series B |
Keywords | DocType | Volume |
Turán number,Berge hypergraph,Bipartite graph | Journal | 137 |
ISSN | Citations | PageRank |
0095-8956 | 1 | 0.36 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dániel Gerbner | 1 | 46 | 21.61 |
| Abhishek Methuku | 2 | 18 | 9.98 |
| Máté Vizer | 3 | 1 | 0.36 |