Cohomology conjecture for the complete graph
Let be the complete graph on five vertices. Complete-graph conjecture.
The source presents this as a conjectural computational pattern and gives no resolution.
References
Primary source
Milena D. Pabiniak, Jozef H. Przytycki and Radmila Sazdanovic, “On the first group of the chromatic cohomology of graphs”, arXiv:math/0607326 (2006).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.