47 citations · 47 across the 6 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
math.CO2015
Largest Domination Number and Smallest Independence Number of Forests with given Degree Sequence
Michael Gentner, Michael A. Henning, Dieter Rautenbach
For a sequence of non-negative integers, let be the set of all forests whose degree sequence is . We present closed formulas for $γ_{\max}^{\cal F}(d)=\max\{ γ…
math.CO2015
Smallest Domination Number and Largest Independence Number of Graphs and Forests with given Degree Sequence
Michael Gentner, Michael A. Henning, Dieter Rautenbach
For a sequence of non-negative integers, let and be the sets of all graphs and forests with degree sequence , respectively. Let $γ_{\min}(d)=\min…
math.CO2015
Independence in Uniform Linear Triangle-free Hypergraphs
Piotr Borowiecki, Michael Gentner, Christian Löwenstein +1
The independence number of a hypergraph is the maximum cardinality of a set of vertices of that does not contain an edge of . Generalizing Shearer's classical low…