Equicovering subgraphs of graphs and hypergraphs (Q405168): Difference between revisions

Summary: As a variation on the \(t\)-equal union property (\(t\)-EUP) introduced by \textit{B. Lindström} [J. Comb. Theory, Ser. A 13, 274--277 (1972; Zbl 0243.05005)], we introduce the \(t\)-equal valence property (\(t\)-EVP) for hypergraphs: a hypergraph satisfies the \(t\)-EVP if there are \(t\) pairwise edge-disjoint subhypergraphs such that for each vertex \(v\), the degree of \(v\) in all \(t\) subhypergraphs is the same. In the \(t\)-EUP, the subhypergraphs just have the same sets of vertices with positive degree. For both the 2-EUP and the 2-EVP, we characterize the graphs satisfying the property and determine the maximum number of edges in a graph not satisfying it. We also study the maximum number of edges in both \(k\)-uniform and general hypergraphs not satisfying the \(t\)-EVP.