On the maximum number of integer colourings with forbidden monochromatic sums

DOI10.37236/8824zbMath1498.11076arXiv1709.09589OpenAlexW3148148526MaRDI QIDQ2662340

Katherine Staden, Maryam Sharifzadeh, Hong Liu

Publication date: 12 April 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.09589

zbMATH Keywords

forbidden monochromatic sumsmaximum number of integer colorings

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Additive bases, including sumsets (11B13)

Related Items (5)

Stability for the Erdős-Rothschild problem ⋮ Integer colorings with no rainbow 3-term arithmetic progression ⋮ Integer colorings with no rainbow \(k\)-term arithmetic progression ⋮ Integer colorings with forbidden rainbow sums ⋮ A note on the largest sum‐free sets of integers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-colorings avoiding fixed rainbow stars
• Hypergraph containers
• A structural result for hypergraphs with many restricted edge colorings
• A new proof of the graph removal lemma
• A coloring problem for intersecting vector spaces
• A combinatorial proof of the removal lemma for groups
• On the number of graphs without 4-cycles
• On the structure of large sum-free sets of integers
• Edge-colorings avoiding a fixed matching with a prescribed color pattern
• Maximum number of sum-free colorings in finite abelian groups
• Colourings without monochromatic disjoint pairs
• Edge-colorings of graphs avoiding complete graphs with a prescribed coloring
• A remark on the number of edge colorings of graphs
• Sum-free sets in abelian groups
• The number of oriantations having no fixed tournament
• Edge-colorings of graphs avoiding fixed monochromatic subgraphs with linear Turán number
• A Szemerédi-type regularity lemma in abelian groups, with applications
• Kneser Colorings of Uniform Hypergraphs
• Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size
• The maximum number of K ₃ -free and K ₄ -free edge 4-colorings
• The number of maximal sum-free subsets of integers
• Counting sumsets and sum-free sets modulo a prime
• On Colourings of Hypergraphs Without Monochromatic Fano Planes
• The Asymptotic Number of Lattices
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• THE CAMERON–ERDOS CONJECTURE
• Independent sets in hypergraphs
• The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques

This page was built for publication: On the maximum number of integer colourings with forbidden monochromatic sums