The Ramsey equivalence conjecture for uniform trees
Let , let and be -uniform trees of order , and let be the complete -uniform hypergraph on vertices. The Ramsey equivalence conjecture for uniform trees.
This conjecture asserts that the Ramsey number against a complete -uniform hypergraph depends only on the order of the -uniform tree, not on its structure. It is presented as one of several conjectures arising from the work, with no resolution supplied in the source.
References
- Mark Budden and Andrew Penland, “Trees and n-Good Hypergraphs”, arXiv:1710.05731 (2017).
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.