9 problems
Let be the symmetric group on . For a fixed permutation , let be the set of permutations in tha…
Let be an acyclic forbidden pattern, and let be its unordered bipartite graph. Füredi–Hajnal acyclic-pattern conjecture. One should have … The pape…
Let be any forbidden pattern, and let be its unordered bipartite graph. Let denote the maximum number of ones in an…
Pettie–Tardos conjecture. Every light -free pattern has a linear extremal function.
Let be the class of acyclic 0–1 patterns. Acyclic-pattern conjecture. Both of the following forms are proposed: - Weak Form: For all…
Let be an -uniform forest with interval chromatic number . Füredi–Jiang–Kostochka–Mubayi–Verstraëte conjecture. The maximum number of edges in a vertex-ordered -unifor…
Acyclic forbidden-matrix conjecture. Let be an acyclic zero-one matrix. Then every zero-one matrix that is both -free and -free contains a hom…
Acyclic-matrix conjecture. For every acyclic zero-one matrix and every , there is a such that every -free zero-one matrix with at least…
Simple-matrix conjecture. Let be a simple zero-one matrix. Then every -free zero-one matrix contains a homogeneous submatrix, for a suitable consta…