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

DOI10.1007/S10878-022-00968-6OpenAlexW4312105941MaRDI QIDQ2111206

Yanyan Li

Publication date: 28 December 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-022-00968-6

zbMATH Keywords

transversalextremal hypergraph\(k\)-uniform

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Transversal (matching) theory (05D15)

Cites Work

• Unnamed Item
• Unnamed Item
• 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: A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size