1,382 problems
Let be the Hamming cube with Hamming distance. A subset is maximally diameter- if its diameter is and adjoining any point outside it produces diameter gre…
Let be the complete graph on vertices. In a general edge-coloring of , let denote the minimum number of colors needed so that all triangles have distinct…
Latin-strategy characterization conjecture. Optimal strategies are exactly Latin strategies.
Catalan classification conjecture. There are exactly families of size in which every two distinct paths have an even number of common edges.
For a graph , let be the unique such that … Define the expectation threshold by … The second Kahn–Kalai conjecture. There is a fixed such that for any…
Let denote the minimum integer such that every red-blue coloring of the edges of the complete graph on vertices contains a red copy of or a blue copy of…
Let be the partition graph, let and denote its axial and spinal vertex sets, and let…
Kahn's conjecture. If , then
Let , , and be upward closed subsets of . It is conjectured that … Notation: the poset is the power set of a set with elements, ordered by subset relation.…
For each integer , let be the oriented graph consisting of two internally vertex-disjoint directed paths of length with the same initial vertex and the same te…
For integers and , let be the minimum number of edges in an intersecting -uniform hypergraph such that every -element subset…
For integers , , and , let be an -vertex -uniform hypergraph. Define … where is the degree of in . Set . If … the…
There exists an absolute constant such that, for every positive integer and every set of points for which every line contains at most…
For every odd integer , define . The large-tight-component conjecture asserts that, for sufficiently large , every -vertex -uniform…
For an integer , let denote the maximum cardinality of a code such that for every pair of distinct codewords…
Let be the maximum of over all intersecting -uniform hypergraphs with covering number . The Frankl–Ota–Tokushige conjec…
For integers , , and , determine , the maximum number of edges in an -vertex, -uniform, connect…
For every finite -uniform hypergraph , the off-diagonal Ramsey number is polynomially bounded in if and only if there exists an integer such that is…
For every connected simple graph of order with minimum degree $$\delta, let be the family of vertex sets such that the induced s…
For every -uniform hypergraph , determine when its cherry Turán density vanishes. The claimed characterization is if and only if is max-layered. The corre…
For every integer , the saturation number of the complete graph in three-uniform Berge hypergraphs satisfies . Eq…
For an integer , let be the least integer for which there exists a family of nonempty subsets of an -element set such that and…
For a graph , let be the maximum integer such that contains an induced subgraph on vertices that is a cograph. Is there an absolute constant…
For every fixed integer and every , there exists such that every digraph with edges and minimum outdegree…
For all positive integers , the crossing number of the complete bipartite graph is …