An upper bound for the transversal number of connected k-uniform hypergraphs

DOI10.1007/S40305-022-00445-1MaRDI QIDQ6601976FDOQ6601976

Authors: Zian Chen, Bin Chen 

Publication date: 11 September 2024

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

Recommendations

• A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size
• On the transversal number of \(k\)-uniform connected hypergraphs
• Upper transversals in hypergraphs
• On upper transversals in 3-uniform hypergraphs
• Bounds on upper transversals in hypergraphs

zbMATH Keywords

perfect matchingtransversal number\(k\)-uniform hypergraph

Mathematics Subject Classification ID

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

Cites Work

• Covering all cliques of a graph
• Small transversals in hypergraphs
• Transversal numbers of uniform hypergraphs
• Total domination of graphs and small transversals of hypergraphs
• An upper bound for the transversal numbers of 4-uniform hypergraphs
• Hypergraphs with large transversal number and with edge sizes at least four
• Hypergraphs with large transversal number
• Linear hypergraphs with large transversal number and maximum degree two
• A note on improved upper bounds on the transversal number of hypergraphs
• Title not available (Why is that?)
• Transversals in 4-uniform hypergraphs
• Affine planes and transversals in 3-uniform linear hypergraphs
• On the vertex cover number of 3-uniform hypergraph

Cited In (1)

• On the transversal number of \(k\)-uniform connected hypergraphs

This page was built for publication: An upper bound for the transversal number of connected \(k\)-uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601976)