One Turán Type Problem on Uniform Hypergraphs
Sign Up to like & getrecommendations! Published in 2024 at "Axioms"
DOI: 10.3390/axioms13080544
Abstract: Let n,m,p,r∈N with p≥n≥r. 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… read more here.
Keywords: problem uniform; one tur; type problem; tur type ... See more keywords