Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777098 | Electronic Notes in Discrete Mathematics | 2017 | 4 Pages |
Abstract
Gyárfás, GyÅri and Simonovits also proved that a linear-cycle-free 3-uniform hypergraph contains a vertex of strong degree at most 2. In this context, we show that a linear-cycle-free 3-uniform hypergraph has a vertex of degree at most nâ2 when nâ¥10.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Beka Ergemlidze, Ervin GyÅri, Abhishek Methuku,