Level Hypergraphs-II

Abstract

In a previous paper [14] we introduced a way of relating any hypergraph with a simpler one, which retains its edge-structure but has often much less vertices. This allows results in several branches of hypergraph theory.

In this paper we define the tool again, and give several examples of its use. While some of the results obtained apply to different classes of hypergraphs than the original statements, others are generalisations of classical theorems.

Keywords:

• hypergraph
• edge colouring
• transversal set

2010 Mathematics Subject Classification:

• 05C20
• 05C65
• 05C69