On the transversal number of rank \(k\) hypergraphs

DOI10.1007/978-3-031-20796-9_12zbMath1528.05051OpenAlexW4313349545MaRDI QIDQ6111474

Zhuo Diao, Zhongzheng Tang

Publication date: 3 August 2023

Published in: Frontiers of Algorithmic Wisdom (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-20796-9_12

zbMATH Keywords

transversalextremal hypergraphsmaximum degree 2rank-\(k\) hypergraphs

Mathematics Subject Classification ID

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

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
• A partial k-arboretum of graphs with bounded treewidth
• An upper bound for the transversal numbers of 4-uniform hypergraphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• 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