The conjecture that an off-diagonal common pair has a common component
Let and be graphs, and let . A pair is -common when it satisfies the off-diagonal common-pair inequality for every complementary pair of graphons. Common-component conjecture. If there exists such that is -common, then at least one of or is common. The theorem exhibiting a pair with an uncommon component shows that both components need not be common, while this weaker assertion remains open.
References
- Natalie Behague, Natasha Morrison and Jonathan A. Noel, “Off-Diagonal Commonality of Graphs via Entropy”, arXiv:2307.03788 (2023).
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.