Maximum number of sum-free colorings in finite abelian groups

DOI10.1007/S11856-018-1705-1zbMath1402.05210arXiv1710.08352OpenAlexW2962839324WikidataQ129713545 ScholiaQ129713545MaRDI QIDQ1659538

Hiệp Hàn, Andrea Jiménez

Publication date: 22 August 2018

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

coloringcontainer methodsum-free set

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (11)

Edge-colorings of graphs avoiding complete graphs with a prescribed coloring ⋮ Stability for the Erdős-Rothschild problem ⋮ Remarks on an edge-coloring problem ⋮ Integer colorings with no rainbow 3-term arithmetic progression ⋮ Integer colorings with no rainbow \(k\)-term arithmetic progression ⋮ Improved Bound on the Maximum Number of Clique-Free Colorings with Two and Three Colors ⋮ On the maximum number of integer colourings with forbidden monochromatic sums ⋮ Integer colorings with forbidden rainbow sums ⋮ A note on the largest sum‐free sets of integers ⋮ Rainbow Erdös--Rothschild Problem for the Fano Plane ⋮ Colouring set families without monochromatic \(k\)-chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hypergraphs with many Kneser colorings
• Hypergraph containers
• A structural result for hypergraphs with many restricted edge colorings
• Sum-free subsets of finite abelian groups of type III
• Counting sum-free sets in abelian groups
• Sum-free sets in abelian groups
• A Szemerédi-type regularity lemma in abelian groups, with applications
• The maximum number of K ₃ -free and K ₄ -free edge 4-colorings
• On Colourings of Hypergraphs Without Monochromatic Fano Planes
• Maximal sum-free sets in finite abelian groups, V
• THE NUMBER OF EDGE COLORINGS WITH NO MONOCHROMATIC CLIQUES
• Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs
• Independent sets in hypergraphs
• Maximal sum-free sets of elements of finite groups
• Maximal sum-free sets in finite abelian groups

This page was built for publication: Maximum number of sum-free colorings in finite abelian groups