Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

Bounds on the Number of Edges of Edge-Minimal, Edge-Maximal and L-Hypertrees

Péter G.N. Szabó — 2016

Discussiones Mathematicae Graph Theory

In their paper, Bounds on the number of edges in hypertrees, G.Y. Katona and P.G.N. Szabó introduced a new, natural definition of hypertrees in k- uniform hypergraphs and gave lower and upper bounds on the number of edges. They also defined edge-minimal, edge-maximal and l-hypertrees and proved an upper bound on the edge number of l-hypertrees. In the present paper, we verify the asymptotic sharpness of the [...] upper bound on the number of edges of k-uniform hypertrees given in the above mentioned...

Page 1

Download Results (CSV)