8,421 research outputs found
Integer colorings with forbidden rainbow sums
For a set of positive integers , an -coloring of is
rainbow sum-free if it contains no rainbow Schur triple. In this paper we
initiate the study of the rainbow Erd\H{o}s-Rothchild problem in the context of
sum-free sets, which asks for the subsets of with the maximum number of
rainbow sum-free -colorings. We show that for , the interval is
optimal, while for , the set is optimal. We
also prove a stability theorem for . The proofs rely on the hypergraph
container method, and some ad-hoc stability analysis.Comment: 20 page
Antichain cutsets of strongly connected posets
Rival and Zaguia showed that the antichain cutsets of a finite Boolean
lattice are exactly the level sets. We show that a similar characterization of
antichain cutsets holds for any strongly connected poset of locally finite
height. As a corollary, we get such a characterization for semimodular
lattices, supersolvable lattices, Bruhat orders, locally shellable lattices,
and many more. We also consider a generalization to strongly connected
hypergraphs having finite edges.Comment: 12 pages; v2 contains minor fixes for publicatio
Bounds on the Coefficients of Tension and Flow Polynomials
The goal of this article is to obtain bounds on the coefficients of modular
and integral flow and tension polynomials of graphs. To this end we make use of
the fact that these polynomials can be realized as Ehrhart polynomials of
inside-out polytopes. Inside-out polytopes come with an associated relative
polytopal complex and, for a wide class of inside-out polytopes, we show that
this complex has a convex ear decomposition. This leads to the desired bounds
on the coefficients of these polynomials.Comment: 16 page
- …