Abstract
Union-free families of subsets of [n] = {1, . . . , n} have been studied in Frankl and Füredi (Eur J Combin 5:127–131, 1984). In this paper, we provide a complete characterization of maximal symmetric difference-free families of subsets of [n].
Similar content being viewed by others
References
Babai L., Sos V.T.: Sidon sets in groups and induced subgraphs of Cayley graphs. Eur. J. Combin. 1, 1–11 (1985)
Erdős P., Ko C., Rado R.: Intersection theorems for systems of finite sets. Quart. J. Math. Oxford Series 2 12, 313–320 (1961)
Frankl P., Füredi Z.: Union-free hypergraphs and probability theory. Eur. J. Combin. 5, 127–131 (1984)
O’Bryant, K.: A complete annotated bibliography of work related to Sidon sequences. Electr. J. Combin. Dynamical Survey #DS11. http://www.combinatorics.org/Surveys/ds11.pdf (2004)
Sperner E.: Ein Satz über Untermengen einer endlichen Menge. Math. Zeitschrift 27, 544–548 (1928)
West D.: Introduction to Graph Theory, 2nd edn. Prentice Hall, New Jersey (2000)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Buck, T.G., Godbole, A.P. Size-Maximal Symmetric Difference-Free Families of Subsets of [n]. Graphs and Combinatorics 30, 101–108 (2014). https://doi.org/10.1007/s00373-012-1255-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-012-1255-y