On the feedback number of 3-uniform hypergraph
Combinatorics
2018-07-30 v1
Abstract
Let be a hypergraph with vertex set and edge set . is a feedback vertex set (FVS) of if has no cycle and denote the minimum cardinality of a FVS of . In this paper, we prove if is a linear -uniform hypergraph with edges, then . if is a -uniform hypergraph with edges, then and furthermore, the equality holds on if and only if every component of is a cycle. Let be a hypergraph with vertex set and edge set . is a feedback edge set (FES) of if has no cycle and denote the minimum cardinality of a FES of . In this paper, we prove if is a -uniform hypergraph with components, then .
Keywords
Cite
@article{arxiv.1807.10456,
title = {On the feedback number of 3-uniform hypergraph},
author = {Zhuo Diao and Zhongzheng Tang},
journal= {arXiv preprint arXiv:1807.10456},
year = {2018}
}