Sign Up to like & get
recommendations!
1
Published in 2018 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-018-1921-9
Abstract: The matching number $$\alpha '(H)$$α′(H) of a hypergraph H is the size of a largest matching in H, where a matching is a set of pairwise disjoint edges in H. A dominating set in H…
read more here.
Keywords:
domination number;
finite projective;
intersecting hypergraphs;
uniform linear ... See more keywords