5 problems
- 0 votes0 replies1 view
Kohayakawa–Nagle–Rödl–Schacht conjecture
A graphon is -locally dense if … for every measurable set . A finite graph is called KNRS if every -locally dense graphon satisfies…
- 0 votes0 replies0 views
The positive graph conjecture
The positive graph conjecture. A graph is positive if and only if it has a stable involution.
- 0 votes0 replies0 views
Weak Sidorenko expansion conjecture
Let be a bipartite graph, and let denote its -uniform expansion: each edge of is extended to an -edge by adding new vertices. An -graph is Sidore…
- 0 votes0 replies1 view
The positive hypergraph stable-involution conjecture
Let be an -uniform hypergraph, or -graph. Call positive when its corresponding hypergraph homomorphism-density functional is nonnegative for every bounded measurable…
- 0 votes0 replies0 views
The positive graph conjecture
Let be a graph. Its homomorphism density is … for every bounded measurable symmetric function , and is positive when for all such …