13 problems
- 0 votes0 replies1 view
Polynomial graph-partition conjecture for bounded-VC hypergraphs
Polynomial graph-partition conjecture. If has bounded VC dimension, then it has an -graph partition with many…
- 0 votes0 replies1 view
Double-tower upper-bound conjecture for regularity of bounded-VC hypergraphs
Let be a -graph with bounded VC dimension, and let denote the vertex partition in the upper-bound theorem. Double-tower upper-bound conjecture.…
- 0 votes0 replies0 views
Tower lower bound for quasirandom cylinder partitions
Let -quasirandom cylinder partitions be partitions of a tripartite -graph satisfying the quasirandomness condition used in the cylinder regularity lemma, and let…
- 0 votes0 replies0 views
The equitable semialgebraic regularity conjecture
Equitable regularity conjecture. The equitable semialgebraic regularity lemma holds with partitions into
- 0 votes0 replies0 views
Tower-growth conjecture for hereditary 3-uniform hypergraph properties
Let be a hereditary property of -uniform hypergraphs with infinite -dimension. Let denote the associa…
- 0 votes0 replies0 views
Chernikov–Towsner sub-Wowzer bound conjecture for regular decompositions
Let be a -uniform hypergraph of bounded -dimension, and consider regular decompositions whose parameter bounds the number of parts in the underlying p…
- 0 votes0 replies1 view
Balogh–Butterfield–Hu–Lenz conjecture on maximum -free subhypergraphs
Let be the random -uniform hypergraph on vertex set , where each triple in is included independently with probability . A subh…
- 0 votes0 replies0 views
Higher-dimensional HP and Green–Sanders examples
For , let be the -graph defined by the displayed hyperplane-order construction, and let be its closure under isomo…
- 0 votes0 replies1 view
The XOP2 characterization of binary disc2,3-error
Let be the language of ternary -graph relations, and let be a proposed definition given by an infinite scheme of existential sentences. X…
- 0 votes0 replies0 views
An underlying characterization of binary disc2,3-error
Let and denote the hereditary -graph properties constructed from the hyperplane-order and Green–Sanders examples. Under…
- 0 votes0 replies0 views
Weakly stable properties admit zero vdisc3-error
Let be a hereditary -graph property. It is weakly stable if there is some such that every -graph in is weakly -stable, where weakly -sta…
- 0 votes0 replies0 views
Weak stability and zero vdisc3-error
Let be a hereditary -graph property. For , let be the -graph with vertex set and edge set…
- 0 votes0 replies1 view
Weakly stable properties and decompositions with binary error
Let a hereditary -graph property be a class of finite -uniform hypergraphs closed under isomorphism and induced subgraphs. A decomposition is the type of decomposition appear…