A. Dainiak

activity

20082020

most citedSharp bounds for the number of maximal independent sets in trees of fixed diameter

4 citations · 4 across the 1 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2016

Uniqueness of the extremal graph in the problem of maximizing the number of independent sets in regular graphs

Alexei Dmitriev, Alex Dainiak

The main purpose of this paper is to prove the uniqueness of a graph attaining the maximum of the number of independent sets over all $k$ -regular graphs on $n$ vertices for $2 k ∣ n$ .

math.CO2008★ 4 cited

Sharp bounds for the number of maximal independent sets in trees of fixed diameter

Alexander Dainiak

We obtain sharp lower and upper bounds for the number of maximal (under inclusion) independent sets in trees with fixed number of vertices and diameter. All extremal trees are desc…