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)
Extremal problems in graph theory (05C35) Arithmetic and combinatorial problems involving abstract finite groups (20D60)
Related Items
On the structure of large sum-free sets of integers, On the number of connected sets in bounded degree graphs, Graphs, partitions and Fibonacci numbers, Upper bound for the number of independent sets in graphs, Interview with Yufei Zhao, Sum-free sets in abelian groups, Online containers for hypergraphs, with applications to linear equations, On the number of independent sets in simple hypergraphs, Independent sets in quasi-regular graphs, Counting independent sets in triangle-free graphs, On replica symmetry of large deviations in random graphs, Extremal Regular Graphs: Independent Sets and Graph Homomorphisms, Counting generalized sum-free sets, On the Number of Connected Sets in Bounded Degree Graphs, Bounds on the Number of Maximal Sum-Free Sets, On the number of maximal sum-free sets, The number of independent sets in a graph with small maximum degree, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Counting independent sets in regular hypergraphs, The Cameron-Erdős conjecture, Hypergraph containers, The Number of Independent Sets in a Regular Graph, Independent sets in graphs, A proof of the upper matching conjecture for large graphs, On the number of \(r\)-matchings in a tree, Asymptotics for the logarithm of the number of \((k,l)\)-sum-free sets in groups of prime order, Entropy, independent sets and antichains: A new approach to Dedekind’s problem, Maximizing H‐Colorings of a Regular Graph, Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree, Asymptotics of the number of sum-free sets in groups of prime order, Counting MSTD sets in finite abelian groups, Counting sum-free sets in abelian groups, Random sum-free subsets of abelian groups, 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., Symmetric complete sum-free sets in cyclic groups, Asymptotics for the logarithm of the number of \(k\)-solution-free sets in abelian groups, Asymptotics for the Logarithm of the Number of (k, l)-Solution-Free Collections in an Interval of Naturals, The number of independent sets in an irregular graph, ON THE MAXIMUM SIZE OF A (k,l)-SUM-FREE SUBSET OF AN ABELIAN GROUP, Number of \(A + B \neq C\) solutions in abelian groups and application to counting independent sets in hypergraphs, Unnamed Item, Bounds on the number of maximal sum-free sets, An upper bound for the number of independent sets in regular graphs, Tight bounds on the coefficients of partition functions via stability, Covers, orientations and factors, A reverse Sidorenko inequality, Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth, Counting colorings of a regular graph, Counting independent sets in graphs, Cameron-Erdős modulo a prime
Cites Work
