{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:19:27Z","timestamp":1760145567113,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T00:00:00Z","timestamp":1723334400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>Let n,m,p,r\u2208N with p\u2265n\u2265r. For a hypergraph, if each edge has r vertices, then the hypergraph is called an r-graph. Define er(n,m;p) to be the maximum number of edges of an r-graph with p vertices in which every subgraph of n vertices has at most m edges. Researching this function constitutes a Tur\u00e1n type problem. In this paper, on the one hand, for fixed p, we present some results about the exact values of er(n,m;p) for small m compared to n; on the other hand, for sufficient large p, we use the combinatorial technique of double counting to give an upper bound of e(n,m;p) and obtain a lower bound of er(n,m;p) by applying the lower bound of the independent set of a hypergraph.<\/jats:p>","DOI":"10.3390\/axioms13080544","type":"journal-article","created":{"date-parts":[[2024,8,12]],"date-time":"2024-08-12T11:23:46Z","timestamp":1723461826000},"page":"544","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["One Tur\u00e1n Type Problem on Uniform Hypergraphs"],"prefix":"10.3390","volume":"13","author":[{"given":"Linlin","family":"Wang","sequence":"first","affiliation":[{"name":"School of Mathematics, China University of Mining and Technology, Xuzhou 221116, China"}]},{"given":"Sujuan","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Artificial Intelligence, Tianjin University of Science & Technology, Tianjin 300457, China"}]}],"member":"1968","published-online":{"date-parts":[[2024,8,11]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Keevash, P. (2011). It Hypergraph Tur\u00e1n Problems, Cambridge University Press.","DOI":"10.1017\/CBO9781139004114.004"},{"key":"ref_2","first-page":"436","article-title":"Eine Extremalaufgabe aus der Graphentheorie","volume":"48","year":"1941","journal-title":"Mat. Fiz. Lapok."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1017\/S0963548311000460","article-title":"Tur\u00e1n numbers of multiple paths and equibipartite forests","volume":"20","author":"Bushaw","year":"2011","journal-title":"Comb. Probab. Comput."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","article-title":"On maximal paths and circuits of graphs","volume":"10","author":"Gallai","year":"1959","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/(SICI)1097-0118(199811)29:3<185::AID-JGT6>3.0.CO;2-M","article-title":"Extremal graphs with bounded densities of small subgraphs","volume":"29","author":"Griggs","year":"1998","journal-title":"J. Graph. Theory"},{"key":"ref_6","first-page":"837","article-title":"On the Tur\u00e1n number of forests","volume":"20","author":"Liu","year":"2013","journal-title":"Electron. J. Comb."},{"key":"ref_7","unstructured":"Simonovits, M. (1969). On the Structure of Extremal Graphs. [Ph.D. Thesis, Hungarian Academy of Sciences]."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"273","DOI":"10.4064\/cm139-2-8","article-title":"Tur\u00e1n\u2019s problem and ramsey numbers for trees","volume":"139","author":"Sun","year":"2015","journal-title":"Colloq. Math."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1002\/jgt.22710","article-title":"Tur\u00e1n numbers for disjoint paths","volume":"98","author":"Yuan","year":"2021","journal-title":"J. Graph Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1090\/S0002-9904-1946-08715-7","article-title":"On the structure of linear graphs","volume":"52","author":"Stone","year":"1946","journal-title":"Bull. Am. Math. Soc."},{"key":"ref_11","first-page":"51","article-title":"A limit theorem in graph theory","volume":"1","author":"Simonovits","year":"1966","journal-title":"Studia Sci. Math. Hungar."},{"key":"ref_12","first-page":"228","article-title":"On a problem of Tur\u00e1n in the theory of graphs","volume":"15","author":"Katona","year":"1964","journal-title":"Mat. Lapok."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/BF01895726","article-title":"Extensions of Tur\u00e1ns theorem on graphs","volume":"14","author":"Dirac","year":"1963","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"ref_14","first-page":"27","article-title":"On the maximal number of edges for a graph with n vertices in which a given subgraph with k vertices has no more than l edges","volume":"293","author":"Golberg","year":"1987","journal-title":"Dokl. Akad. Nauk"},{"key":"ref_15","unstructured":"Griggs, J.R., and Thomas, G.R. (1995, January 1\u20135). Maximum size graphs with k-subgraphs of size at most k \u2212 2. Proceedings of the 7th Quadrennial International Conference on the Theory and Applications of Graphs, Kalamazoo, MI, USA."},{"key":"ref_16","first-page":"87","article-title":"One Tur\u00e1n type problem","volume":"2","author":"Sun","year":"1991","journal-title":"J. Nanjing Univ."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02018585","article-title":"On the existence of triangulated spheres in 3-graphs and related problems","volume":"3","author":"Brown","year":"1973","journal-title":"Periodica Math. Hung. Acad. Sci."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Harary, F. (1973). Some Extremal Problems on R-Graphs. New Directions in the Theory of Graphs, Academic Press.","DOI":"10.1016\/B978-0-12-324245-7.50008-3"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.dam.2013.08.046","article-title":"On an extremal hypergraph problem related to combinatorial batch codes","volume":"162","author":"Balachandran","year":"2014","journal-title":"Discret. Appl. Math."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1007\/s10255-023-1067-2","article-title":"On the Tur\u00e1n Density of Uniform Hypergraphs","volume":"3","author":"Chang","year":"2023","journal-title":"Acta Math. Appl. Sin."},{"key":"ref_21","unstructured":"Keedwell, A.D. (1991). Tur\u00e1n Type Problems, Surveys in Combinatorics. London Mathematical Society Lecture Note Series, Cambridge University Press."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01929486","article-title":"What do we know and what we do not know about Tur\u00e1n numbers","volume":"11","author":"Sidorenko","year":"1995","journal-title":"Graphs Comb."},{"key":"ref_23","unstructured":"Stechkin, B., Baranov, V.I., and Sztechkin, B.S. (1989). Extremal Combinatorial Problems and Their Applications, Nauka. (In Russian)."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0012-365X(72)90084-2","article-title":"Tur\u00e1n\u2019s theorems for k-graphs","volume":"2","author":"Spencer","year":"1972","journal-title":"Discret. Math."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/13\/8\/544\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T15:34:48Z","timestamp":1760110488000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/13\/8\/544"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,11]]},"references-count":24,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2024,8]]}},"alternative-id":["axioms13080544"],"URL":"https:\/\/doi.org\/10.3390\/axioms13080544","relation":{},"ISSN":["2075-1680"],"issn-type":[{"type":"electronic","value":"2075-1680"}],"subject":[],"published":{"date-parts":[[2024,8,11]]}}}