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

DOI10.1007/978-3-031-16081-3_32zbMath1525.05135OpenAlexW4296168477MaRDI QIDQ6111625

Zian Chen, Bin Chen, Zhuo Diao, Zhongzheng Tang

Publication date: 7 July 2023

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-16081-3_32

zbMATH Keywords

transversalperfect matchingextremal hypergraph\(k\)-uniform

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Hypergraphs with large transversal number and with edge sizes at least four
• Transversals and matchings in 3-uniform hypergraphs
• Covering triangles in edge-weighted graphs
• Total domination of graphs and small transversals of hypergraphs
• Covering all cliques of a graph
• Small transversals in hypergraphs
• An upper bound for the transversal numbers of 4-uniform hypergraphs
• Hypergraphs with large transversal number
• On the vertex cover number of 3-uniform hypergraph
• Linear hypergraphs with large transversal number and maximum degree two
• Total domination in 2-connected graphs and in graphs with no induced 6-cycles
• Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three

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