Extremal hypergraphs for matching number and domination number
From MaRDI portal
Publication:1693167
DOI10.1016/j.dam.2017.10.019zbMath1377.05131arXiv1611.06629OpenAlexW2553674214MaRDI QIDQ1693167
Erfang Shan, Shan Li, Yanxia Dong, Li-ying Kang
Publication date: 11 January 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.06629
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (7)
Domination in intersecting hypergraphs ⋮ \((\alpha,\beta)\)-labelling method for \(k\)-uniform hypergraph and its applications ⋮ A note on domination in intersecting linear systems ⋮ 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 ⋮ Domination and Total Domination in Hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hypergraphs with large transversal number and with edge sizes at least four
- On Ryser's conjecture
- Hypergraphs with large domination number and with edge sizes at least three
- Matchings and transversals in hypergraphs, domination and independence in trees
- Transversals and domination in uniform hypergraphs
- Transversals and matchings in 3-uniform hypergraphs
- Ryser's conjecture for tripartite 3-graphs
- Small transversals in hypergraphs
- Matchings and covers in hypergraphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Transversal numbers of uniform hypergraphs
- Star-uniform graphs
- Matching and domination numbers in \(r\)-uniform hypergraphs
- Linear hypergraphs with large transversal number and maximum degree two
- Equality of domination and transversal numbers in hypergraphs
- Domination in hypergraphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Hypergraph domination and strong independence
- Total Domination in Graphs
This page was built for publication: Extremal hypergraphs for matching number and domination number
