Any monotone property of 3-uniform hypergraphs is weakly evasive

Publisher:
Springer
Publication Type:
Conference Proceeding
Citation:
LNCS - Theory and Applications of Models of Computation - Proceedings of the10th International Conference, TAMC 2013, 2013, 7876 pp. 224 - 235
Issue Date:
2013-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013005434OK.pdf230.47 kB
Adobe PDF
Our proof combines the combinatorial approach of Rivest and Vuillemin with the topological approach of Kahn, Saks, and Sturtevant. Interestingly, our proof makes use of Vinogradovs Theorem (weak Goldbach Conjecture), inspired by its recent use by Babai et. al. [1] in the context of the topological approach. Our work leaves the generalization to k-uniform hypergraphs as an intriguing open question.
Please use this identifier to cite or link to this item: