Size-maximal symmetric difference-free families of subsets of \([n]\)

DOI10.1007/s00373-012-1255-yzbMath1295.05248arXiv1010.2711OpenAlexW2025479574MaRDI QIDQ2441347

Travis G. Buck, Anant P. Godbole

Publication date: 24 March 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

sum-free setsSidon setsextremal familiessymmetric difference

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Permutations, words, matrices (05A05) Combinatorial probability (60C05) Extremal set theory (05D05) Structural characterization of families of graphs (05C75)

Related Items (1)

Symmetric difference-free and symmetric difference-closed collections of sets

Cites Work

• Union-free hypergraphs and probability theory
• Sidon sets in groups and induced subgraphs of Cayley graphs
• A complete annotated bibliography of work related to Sidon sequences
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: Size-maximal symmetric difference-free families of subsets of \([n]\)