Matching and domination numbers in \(r\)-uniform hypergraphs

DOI10.1007/s10878-016-0098-5zbMath1380.90270OpenAlexW2553039757MaRDI QIDQ2410114

Erfang Shan, Shan Li, Yanxia Dong, Li-ying Kang

Publication date: 17 October 2017

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

Full work available at URL: https://doi.org/10.1007/s10878-016-0098-5

zbMATH Keywords

hypergraphmatchingdominating setintersecting hypergraphfinite projective plane

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (9)

Domination in intersecting hypergraphs ⋮ A note on domination in intersecting linear systems ⋮ Extremal hypergraphs for matching number and domination number ⋮ Domination game on uniform hypergraphs ⋮ The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four ⋮ On a problem of Henning and Yeo about the transversal number of uniform linear systems whose 2-packing number is fixed ⋮ Domination and matching in power and generalized power hypergraphs ⋮ The spectral radius and domination number in linear uniform hypergraphs ⋮ Domination and Total Domination in Hypergraphs

Cites Work

• On Ryser's conjecture
• Transversals and domination in uniform hypergraphs
• Ryser's conjecture for tripartite 3-graphs
• Upper bound for transversals of tripartite hypergraphs
• A note on a conjecture of Ryser
• Matchings and covers in hypergraphs
• Equality of domination and transversal numbers in hypergraphs
• Total Domination in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Matching and domination numbers in \(r\)-uniform hypergraphs