All Questions

Question. Does every hypergraph that does not admit a complete minor with $5$ elements have a coloring with $4$ colors? Below are the definitions to make this precise. If $H = (V, E)$ is a hypergraph ...

Generalized hypertree width is a tree-width-like parameter for hypergraphs, which plays an important role in the study of constraint satisfaction problems and related areas. For its more well-known ...

Is there a theory of hypergraph minors? I could only find some attempts to define them at papers/theses, whose main topic was something else. What would be a useful definition? Does the hypergraph ...