2 problems

Turán-density conjecture for partially directed k-graphs
Partially directed triangle conjecture. For all sufficiently large $n$ , every $n$ -vertex partially directed $k$ -graph with $\alpha\binom{n}{k}$ undirected edges and…
openextremal-combinatorics hypergraph-turan-theory k-sat
0 responses
09
Bollobás–Brightwell–Leader conjecture on enumerating k-SAT functions
Bollobás–Brightwell–Leader conjecture. The number of $k$ -SAT functions on $n$ boolean variables is
openboolean-functions enumerative-combinatorics k-sat
0 responses
06

Turán-density conjecture for partially directed k-graphs