D. Gerbner and C. Palmer. Extremal results for Berge-hypergraphs. SIAM Journal on Discrete Mathematics, 31.4 (2017): 2314-2327.D. Gerbner, C. Palmer, Extremal results for Berge-hypergraphs, SIAM Journal on Discrete Mathematics 31 (2017) 2314-2327....
Hu, D., Li, X.L., Liu, X.G.et al.Extremality of Graph Entropy Based on Degrees of Uniform Hypergraphs with Few Edges.Acta. Math. Sin.-English Ser.35, 1238–1250 (2019). https://doi.org/10.1007/s10114-019-8093-2 Download citation ...
C. Berge and M. Simonovits: The colouring numbers of the direct product of two hypergraphs, Lecture Notes in Math., 411, Hypergraph Seminar, Columbus, Ohio 1972 (1974) 21–33. Google Scholar B. Bollobás: Graphs without two independent cycles (in Hungarian), Mat. Lapok, 14 (1963) 311...
In particular, we obtain a spectral version of Tur谩n-type problems over linear $k$-uniform hypergraphs by using spectral methods, including a tight result on Berge $C_4$-free linear $3$-uniform hypergraphs.doi:10.37236/9018Yuan Hou
For any r-uniform hypergraph H and a real number p≥1, the p-spectral radius λ(p)(H) of H is defined asλ(p)(H):=max‖x‖p=1r∑{i1,i2,…,ir}∈E(H)xi1xi2xir. In this paper we study the p-spectral radius of Berge-G (G∈Cn+) hypergraphs and determine the 3-uniform...
Berge-hypergraphTuran numberextremal problemsLet F be a graph. We say that a hypergraph H is a Berge-F if there is a bijection f : E(F) -> E(H) such that e subset of f (e) for every e is an element of E(F). Note that Berge-F actually denotes a class of hypergraphs. The...
For any r-uniform hypergraph H and a real number p≥1, the p-spectral radius λ(p)(H) of H is defined asλ(p)(H):=maxx∈Rn,‖x‖p=1r∑{i1,i2,…,ir}∈E(H)xi1xi2xir. In this paper, we study the p-spectral radius of Berge-G hypergraphs. We determine the 3-uniform ...
The extremal p-spectral radius of Berge hypergraphsdoi:10.1016/J.LAA.2020.10.012Liying KangLele LiuLinyuan LuZhiyu WangNorth-Holland
Tompkins, Uniformity thresholds for the asymp- totic size of extremal Berge-F -free hypergraphs, submittedD. Gr´osz, A. Methuku, and C. Tompkins. Uniformity thresholds for the asymptotic size of extremal berge-f-free hypergraphs. Electronic Notes in Discrete Mathematics, 61:527-533, 2017....
doi:10.1016/S0167-5060(08)70328-5Claude BergeAnnals of Discrete MathematicsC. Berge, Algorithms and Extremal Problems for Equipartite Colorings in Graphs and Hypergraphs , volume 2 of Annals of Discrete Mathematics , North- Holland Publishing Co. (1978) pp. 149–150....