Independent sets in regular graphs and sum-free subsets of finite groups
From MaRDI portal
Publication:1182658
DOI10.1007/BF02772952zbMath0762.05050MaRDI QIDQ1182658
Publication date: 28 June 1992
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
05C35: Extremal problems in graph theory
20D60: Arithmetic and combinatorial problems involving abstract finite groups
Related Items
An upper bound for the number of product-free sets in a class of groups, On the number of independent sets in graphs with fixed independence number, Sum-free sets in Abelian groups., The number of independent sets in a graph with small maximum degree, Counting MSTD sets in finite abelian groups, Independent sets in quasi-regular graphs, The Cameron-Erdős conjecture, Bounds on the number of maximal sum-free sets, An upper bound for the number of independent sets in regular graphs, Counting generalized sum-free sets, Cameron-Erdős modulo a prime, Asymptotics for the logarithm of the number of \((k,l)\)-sum-free sets in groups of prime order, Asymptotics of the number of sum-free sets in groups of prime order, Graphs, partitions and Fibonacci numbers, Upper bound for the number of independent sets in graphs, Sum-free sets in abelian groups, On the number of maximal sum-free sets, Entropy, independent sets and antichains: A new approach to Dedekind’s problem, Bounds on the Number of Maximal Sum-Free Sets, The Number of Independent Sets in a Regular Graph, ON THE MAXIMUM SIZE OF A (k,l)-SUM-FREE SUBSET OF AN ABELIAN GROUP
Cites Work
