16 problems
Let . A polytope contains when , and denotes the covering number of by translate…
Let and let , where . Write for the irreducible character of indexed by , let…
Let be a regular set in , and let denote its covering number at scale . Covering-number dependence conjecture. There exists a…
Pinnable rainbow matching conjecture. If
General pinnable covering conjecture. If is pinnable, then
Pinnable covering conjecture. If is pinnable, then
Gyárfás–Lehel conjecture. Then
Let be an -vertex graph, let denote its number of triangles, and let be the minimum size of a vertex set meeting every triangle. For integers…
Refined intersecting-segment conjecture. If is an intersecting -segment hypergraph and , then
Let be the set of all integers that are covering numbers, meaning integers of the form for some group . Non-covering-number infinitude conjecture. The…
A finite group is -elementary if is finite and for every proper quotient of . A group is monolithic primitive if it is primitive and has a uniq…
Let be a convex body with nonempty interior, and let denote the least number of translates of needed to cover . A parallelotope is an aff…
Covering-number duality conjecture. There are universal constants such that, for every dimension and every pair of symmetric convex bodies ,
Let be an -partite hypergraph with matching number . A set is contained in a side or in an edge if it is a subset of one of the sides or of one edge, respective…
Let be an intersecting -partite hypergraph with sides . A cover is a set of vertices meeting every edge. The structured-cover conjecture. There exists either…
Let be a convex body, and let denote its weighted covering number. Weighted Levi–Hadwiger covering conjecture. … Moreover, equality hol…