English

On the feedback number of 3-uniform hypergraph

Combinatorics 2018-07-30 v1

Abstract

Let H=(V,E)H=(V,E) be a hypergraph with vertex set VV and edge set EE. SVS\subseteq V is a feedback vertex set (FVS) of HH if HSH\setminus S has no cycle and τc(H)\tau_c(H) denote the minimum cardinality of a FVS of HH. In this paper, we prove (i)(i) if HH is a linear 33-uniform hypergraph with mm edges, then τc(H)m/3\tau_c(H)\le m/3. (ii)(ii) if HH is a 33-uniform hypergraph with mm edges, then τc(H)m/2\tau_c(H)\le m/2 and furthermore, the equality holds on if and only if every component of HH is a 22-cycle. Let H=(V,E)H=(V,E) be a hypergraph with vertex set VV and edge set EE. AEA\subseteq E is a feedback edge set (FES) of HH if HAH\setminus A has no cycle and τc(H)\tau_c'(H) denote the minimum cardinality of a FES of HH. In this paper, we prove if HH is a 33-uniform hypergraph with pp components, then τc(H)2mn+p\tau_c'(H)\le 2m-n+p.

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}
}
R2 v1 2026-06-23T03:16:27.583Z