The jump-separation conjecture for generalized directed hypergraph theories
The jump-separation conjecture for generalized directed hypergraph theories
From papers
Let and be -ary generalized directed hypergraph theories for . Write for the set of jumps of and for its multiplicity parameter. Jump-separation conjecture. If and , then there exists some that is a jump for but not for . The conjecture is false when , since every is a jump for digraphs; its validity for remains open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Alex Cameron, “Extremal Problems on Generalized Directed Hypergraphs”, arXiv:1607.04927 (2016).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.