The Bounds of the Edge Number in Generalized Hypertrees
A hypergraph <inline-formula> <math display="inline"> <semantics> <mrow> <mi>H</mi> <mo>=</mo> <mo>(</mo> <mi>V</mi> <mo>,</mo> <mi>ε</mi> <mo>)</mo> </mrow> </sema...
Main Authors: | Ke Zhang, Haixing Zhao, Zhonglin Ye, Yu Zhu, Liang Wei |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-12-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/7/1/2 |
Similar Items
-
Bounds on the Number of Edges of Edge-Minimal, Edge-Maximal and L-Hypertrees
by: Szabó Péter G.N.
Published: (2016-05-01) -
Asymptotic Sharpness of Bounds on Hypertrees
by: Lin Yi, et al.
Published: (2017-08-01) -
Corrigendum to: Bounds on the Number of Edges of Edge-Minimal, Edge-Maximal and l-Hypertrees [Discussiones Mathematicae Graph Theory 36 (2016) 259–278]
by: Szabó Péter G.N.
Published: (2022-02-01) -
The <i>l</i><sub>1</sub>-Embeddability of Hypertrees and Unicyclic Hypergraphs
by: Guangfu Wang, et al.
Published: (2022-10-01) -
Knots and Knot-Hyperpaths in Hypergraphs
by: Saifur Rahman, et al.
Published: (2022-01-01)