English

Maximal Symmetric Difference-Free Families of Subsets of $[n]$

Combinatorics 2010-10-14 v1

Abstract

Union-free families of subsets of [n]={1,...n}[n]=\{1,... n\} have been studied in \cite{FF}. In this paper, we provide a complete characterization of maximal {\it symmetric difference}-free families of subsets of [n][n].

Keywords

Cite

@article{arxiv.1010.2711,
  title  = {Maximal Symmetric Difference-Free Families of Subsets of $[n]$},
  author = {Travis G. Buck and Anant P. Godbole},
  journal= {arXiv preprint arXiv:1010.2711},
  year   = {2010}
}

Comments

10 pages