DOIAbstract
AbstractNew upper bounds for the number of independent sets in graphs are obtained
AbstractNew upper bounds for the number of independent sets in graphs are obtained
We determine the maximum number of maximal independent sets which a connected graph on n vertices ca...
We determine the maximum number of maximal independent sets which a connected graph on n vertices ca...
An outindependent subgraph of a graph G, with respect to an independent vertex subset C¿¿V, is the s...
Settling Kahn's conjecture (2001), we prove the following upper bound on the number i(G) of independ...
Abstract: We prove a conjecture of Alon on the number of independent sets in a regular graph, and th...
We consider the number of vertex independent sets i(G)In general, the problem of determining the val...
Amongst d-regular r-uniform hypergraphs on n vertices, which ones have the largest number of indepen...
Abstract. We consider the number of vertex independent sets i(G). In general, the problem of determi...
AbstractLet G be a regular graph of order n and degree δ. The independent domination number i(G) is ...
The study of extremal problems related to independent sets in hypergraphs is a problem that has gene...
AbstractIn this paper, we determine upper and lower bounds for the number of independent sets in a u...
We enumerate the independent sets of several classes of regular and almost regular graphs and comput...
We enumerate the independent sets of several classes of regular and almost regular graphs and comput...
In this paper, we deal with the problem of finding quasi-independent sets in graphs. This problem is...
Abstract Let G be a triangle-free graph with n vertices and average degree t. We show that G contain...
We determine the maximum number of maximal independent sets which a connected graph on n vertices ca...
We determine the maximum number of maximal independent sets which a connected graph on n vertices ca...
An outindependent subgraph of a graph G, with respect to an independent vertex subset C¿¿V, is the s...
Settling Kahn's conjecture (2001), we prove the following upper bound on the number i(G) of independ...
Abstract: We prove a conjecture of Alon on the number of independent sets in a regular graph, and th...
We consider the number of vertex independent sets i(G)In general, the problem of determining the val...
Amongst d-regular r-uniform hypergraphs on n vertices, which ones have the largest number of indepen...
Abstract. We consider the number of vertex independent sets i(G). In general, the problem of determi...
AbstractLet G be a regular graph of order n and degree δ. The independent domination number i(G) is ...
The study of extremal problems related to independent sets in hypergraphs is a problem that has gene...
AbstractIn this paper, we determine upper and lower bounds for the number of independent sets in a u...
We enumerate the independent sets of several classes of regular and almost regular graphs and comput...
We enumerate the independent sets of several classes of regular and almost regular graphs and comput...
In this paper, we deal with the problem of finding quasi-independent sets in graphs. This problem is...
Abstract Let G be a triangle-free graph with n vertices and average degree t. We show that G contain...
We determine the maximum number of maximal independent sets which a connected graph on n vertices ca...
We determine the maximum number of maximal independent sets which a connected graph on n vertices ca...
An outindependent subgraph of a graph G, with respect to an independent vertex subset C¿¿V, is the s...
Add to ORKG