Equicovering subgraphs of graphs and hypergraphs (Q405168): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q557653 |
Changed an Item |
||
Property / author | |||
Property / author: Jae-Hoon Kim / rank | |||
Normal rank |
Revision as of 03:23, 16 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Equicovering subgraphs of graphs and hypergraphs |
scientific article |
Statements
Equicovering subgraphs of graphs and hypergraphs (English)
0 references
4 September 2014
0 references
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.
0 references
hypergraph
0 references
equal union property
0 references
equal valence property
0 references