3 problems
Matching
The positive graph conjecture. A graph is positive if and only if it has a stable involution.
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…
Let be an -uniform hypergraph, or -graph. Call positive when its corresponding hypergraph homomorphism-density functional is nonnegative for every bounded measurable…