7 problems
Simultaneous multipartite subhypergraph conjecture. There exists a partition of into classes such that, for every , at least
Dhawan's conjecture. For every , there is a constant such that, for all sufficiently large ,
Let , let be sufficiently large, and let be a -partite -graph of maximum degree at most . Write for the list chromatic numbe…
Let be the complete multipartite 3-uniform hypergraph whose parts have sizes , and let d…
Let , and let be positive integers. For each , let be a part of size , and let be the -complete -partite…
Let be an -balanced -partite -graph, and let be a subset of . An -tuple is an element of , and an -tuple is defi…
Let ) be an -balanced -partite -graph, and let be a subset of . An -tuple is an element of , and write…