On the vertex cover number of 3-uniform hypergraph

DOI10.1007/S40305-019-00284-7zbMath1488.05351arXiv1807.00473OpenAlexW2998559656WikidataQ126420068 ScholiaQ126420068MaRDI QIDQ2240114

Zhuo Diao

Publication date: 5 November 2021

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.00473

zbMATH Keywords

perfect matchingvertex coverhypertree3-uniform hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

On the transversal number of rank \(k\) hypergraphs ⋮ On the transversal number of \(k\)-uniform connected hypergraphs ⋮ A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size

Cites Work

• Unnamed Item
• Bounding the vertex cover number of a hypergraph
• Nearly perfect matchings in regular simple hypergraphs
• On approximation of the vertex cover problem in hypergraphs
• On the number of nearly perfect matchings in almost regular uniform hypergraphs

This page was built for publication: On the vertex cover number of 3-uniform hypergraph