On the number of maximal sum-free sets

It is shown that the set contains at most maximal sum-free subsets, provided is large enough.

     

Constraints on the number of maximal independent sets in graphs

A maximal independent set of a graph G is an independent set that is not contained properly in any other independent set of G. Let i(G) denote the number of maximal independent sets of G. Here, we prove two conjectures, suggested by P. Erdös, that the maximum number of maximal independent sets among all graphs of order n in a family Φ is o(3^n/3) if Φ is either a family of connected graphs such that the largest value of maximum degrees among all graphs of order n in Φ is o(n) or a family of graphs such that the approaches infinity as n → ∞.     

Counting sum-free sets in abelian groups

In this paper we study sum-free sets of order m in finite abelian groups. We prove a general theorem about independent sets in 3-uniform hypergraphs, which allows us to deduce structural results in the sparse setting from stability results in the dense setting. As a consequence, we determine the typical structure and asymptotic number of sum-free sets of order m in abelian groups G whose order n is divisible by a prime q with q ≡ 2 (mod 3), for every m ? \(C(q)\sqrt {n\log n} \) , thus extending and refining a theorem of Green and Ruzsa. In particular, we prove that almost all sumfree subsets of size m are contained in a maximum-size sum-free subset of G. We also give a completely self-contained proof of this statement for abelian groups of even order, which uses spectral methods and a new bound on the number of independent sets of a fixed size in an (n, d, λ)-graph.     

Regular saturated graphs and sum-free sets

In a recent paper, Gerbner, Patkós, Tuza and Vizer studied regular F-saturated graphs. One of the essential questions is given F, for which n does a regular n-vertex F-saturated graph exist. They proved that for all sufficiently large n, there is a regular $K_3$-saturated graph with n vertices. We extend this result to both $K_4$ and $K_5$ and prove some partial results for larger complete graphs. Using a variation of sum-free sets from additive combinatorics, we prove that for all $k\ge 2$, there is a regular $C_{2k+1}$-saturated with n vertices for infinitely many n. Studying the sum-free sets that give rise to $C_{2k+1}$-saturated graphs is an interesting problem on its own and we state an open problem in this direction.     

Graphs with the second largest number of maximal independent sets

Let G be a simple undirected graph. Denote by (respectively, xi(G)) the number of maximal (respectively, maximum) independent sets in G. Erd?s and Moser raised the problem of determining the maximum value of among all graphs of order n and the extremal graphs achieving this maximum value. This problem was solved by Moon and Moser. Then it was studied for many special classes of graphs, including trees, forests, bipartite graphs, connected graphs, (connected) triangle-free graphs, (connected) graphs with at most one cycle, and recently, (connected) graphs with at most r cycles. In this paper we determine the second largest value of and xi(G) among all graphs of order n. Moreover, the extremal graphs achieving these values are also determined.     

Trees with the second largest number of maximal independent sets

A maximal independent set is an independent set that is not a proper subset of any other independent set. In this paper, we determine the second largest number of maximal independent sets among all trees and forests of order n≥4. We also characterize those extremal graphs achieving these values.     

Difference sets and sum-free sets in groups of order 16

Transversals for sum-free sets in the nine nonabelian order 16 groups are given. It is shown that exactly eight of the order 16 groups have difference sets Dwithλ = 2and D = -D. It is proven that the only (υ, k, λ) difference sets with υ = 2^t and λ = 2, have parameters (16, 6, 2). It is shown that exactly four of the order 16 groups can be partitioned into three sum-free sets.     

The number of maximal independent sets in connected graphs

Generalizing a theorem of Moon and Moser, we determine the maximum number of maximal independent sets in a connected graph on n vertices for n sufficiently large, e.g., n > 50.     

On the structure of large sum-free sets of integers

A set of integers is called sum-free if it contains no triple (x, y, z) of not necessarily distinct elements with x + y = z. In this paper, we provide a structural characterisation of sum-free subsets of {1, 2,..., n} of density at least 2/5 ? c, where c is an absolute positive constant. As an application, we derive a stability version of Hu’s Theorem [Proc. Amer. Math. Soc. 80 (1980), 711–712] about the maximum size of a union of two sum-free sets in {1, 2,..., n}. We then use this result to show that the number of subsets of {1, 2,..., n} which can be partitioned into two sum-free sets is Θ(2^4n/5), confirming a conjecture of Hancock, Staden and Treglown [arXiv:1701.04754].     

Symmetric complete sum-free sets in cyclic groups

We present constructions of symmetric complete sum-free sets in general finite cyclic groups. It is shown that the relative sizes of the sets are dense in [0, 1/3], answering a question of Cameron, and that the number of those contained in the cyclic group of order n is exponential in n. For primes p, we provide a full characterization of the symmetric complete sum-free subsets of ?_p of size at least (1/3?c)·p, where c > 0 is a universal constant.     

Large sum-free sets in ℤ/ p ℤ

We show that ifp is prime andA is a sum-free subset of ℤ/ _p ℤ withn:=|A|>0.33p, thenA is contained in a dilation of the interval [n,p−n] (modp).     

Bounds on the localization number

We consider the localization game played on graphs, wherein a set of cops attempt to determine the exact location of an invisible robber by exploiting distance probes. The corresponding optimization parameter for a graph G is called the localization number and is written as ζ(G). We settle a conjecture of Bosek et al by providing an upper bound on the chromatic number as a function of the localization number. In particular, we show that every graph with ζ(G) ≤ k has degeneracy less than 3^k and, consequently, satisfies χ(G) ≤ 3^ζ(G). We show further that this degeneracy bound is tight. We also prove that the localization number is at most 2 in outerplanar graphs, and we determine, up to an additive constant, the localization number of hypercubes.     

Maximal sum-free sets in finite Abelian groups,III

The main result of this paper is the complete characterization of maximal sum-free sets in Abelian groups of order 3^mn(m ≥ 1) where every prime divisor p of n (if n > 1) is congruent to 1 modulo 3. A few previous results of the author on addition theorems of group theory are also sharpened and/or improved.     

The maximum number of maximal independent sets in unicyclic connected graphs

In this paper, we determine the maximum number of maximal independent sets in a unicyclic connected graph. We also find a class of graphs achieving this maximum value.     

A solution to a problem of Cameron on sum-free complete sets

For any subsets A and B of an additive group G, define A + B = { a + b: a ε A and b ε B} and −A = {−a: a ε A}. A subset S of G is said to be sum-free, complete, and symmetric respectively if S + S S^c, S + S S^c, and S = −S. Cameron asked if for all sufficiently large moduli m there exists a sum-free complete set in Z/mZ that is not symmetric. We answer Cameron's question by showing there exists such a set for all moduli greater than or equal to 890626. We also show that every sum-free complete set in Z/mZ that is not symmetric can be used to construct a counter-example to a conjecture of Conway disproved by Marica. Conway conjectured that for any finite set S of integers, |S + S| |S --- S|.     

Embedding maximal cliques of sets in maximal cliques of bigger sets

Characterizations are obtained of the maximal (k + s)-cliques that contain a given maximal k-clique as a substructure: (1) when s = 1; (2) for arbitrary s when no line of the clique contains exactly one point of the subclique. These characterizations are used to obtain maximal cliques which have fewer lines (for given k) than previously known examples.