215 problems
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…
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 -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…
Let be a fixed nonempty finite set of positive integers, let , and let . Determine exactly when…
Every finite cubic graph has four total dominating sets such that, for every and every vertex ,…
For every integer , is every nonempty finite -uniform hypergraph satisfying necessarily -colourable; equivalently, does…
For every integer , does every finite -uniform hypergraph whose vertex set is partitioned into blocks, each of size at least , and whose maximum vertex degree sat…
Let a hypergraph edge be met by a vertex class if the edge intersects that class. The Bollobás–Scott and Bollobás–Thomason partition conjectures comprise the following assertions.…
For every integer and every , there exists an infinite family of -uniform hypergraphs such that , whi…
For every fixed integer , there exists a constant such that every -uniform hypergraph with edges has a partition satisfy…
For every positive integer and every collection of independent nonnegative random variables satisfying for all , one has…
For every integer , there exists a convex function satisfying … as , such that every uncrowded -uniform hypergraph admits a loca…
For every integer and every finite family of finite simple graphs, each having at least one edge, there exists a constant such that, for…
For every fixed pair of integers , let denote the -uniform linear cycle with hyperedges, and let be the maximum numb…
For every fixed , determine whether the random graph has, with high probability, a fractional triangle decomposition precisely at the conjectured threshold…
For integers and , let be the maximum number of edges in an -uniform hypergraph on vertices such that no set of distinct edges ha…
For every fixed arity , every -ary constraint-satisfaction problem having a Mal'tsev extension has linear non-redundancy; equivalently, its non-redundancy is in the re…
For the tetrahedron , determine whether its Turán density satisfies . Equivalently, if denotes the maximum n…
For every integer and every integer , if is a finite simple -uniform -regular hypergraph, then the number of weak independent sets of satisfies…