10 problems
Kühn–Osthus conjecture. Every regular tripartite tournament has a Hamilton decomposition.
Let be an tripartite graph, and let denote its minimum degree. For an integer , let be the additive term in the condition…
Let and let be sufficiently large. For , an -cyclic triple is a triple satisfying the six cyclic density inequalities stated in…
Let and let be an tripartite graph. Write for the least additive term such that every such graph with minimum degree at…
Bollobás–Erdős–Szemerédi conjecture. There is a constant such that
Let , , and be positive integers such that . Let be a complete tripartite host graph with , where is sufficiently large com…
Let , let be the second region defined in the paper, and let be the specified tripartite graph. For a weighting ,…
Let be edge densities of a weighted tripartite graph, let be the region defined in the paper, let , and let…
Let be the prescribed edge densities, let denote the minimum triangle density over weighted tripartite graphs with the…