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...
1. Introduction and main results Let F=(U,E) be a graph and H=(V,E) be a hypergraph. Generalizing the earlier definitions of Berge-path and Berge-cycle, Gerbner and Palmer [5] introduced the notion of Berge-F hypergraphs. Definition 1 We say that H is a Berge-F if there exist bi...
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...
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 ...
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
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 ef(e) for every e∈E(F). Note that Berge-F actually denotes a class of hypergraphs. The maximum number of edges in an n-...
The extremal p-spectral radius of Berge hypergraphsdoi:10.1016/J.LAA.2020.10.012Liying KangLele LiuLinyuan LuZhiyu WangNorth-Holland
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent Graphs Combin., 2 (1986), pp. 113-121 View in ScopusGoogle Scholar [11] P. Erdős, E. Győri, M. Simonovits How many edges should be deleted to make a triangle-free gra...
C. Berge Graphs and Hypergraphs (1973) North Holland, Amsterdam Google Scholar 2. B. Bollobás Extremal Graph Theory, Academic Press, London (1978) Google Scholar 3. N.G. de Bruijn, P. Erdös A colour problem for infinite graphs and a problem in the theory...
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 ...