{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:43:57Z","timestamp":1753893837455,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>\u00a0As a variation on the $t$-Equal Union Property ($t$-EUP) introduced by Lindstr\u00f6m, 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.\u00a0 In the $t$-EUP, the subhypergraphs just have the same sets of vertices with positive degree.\u00a0 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.\u00a0 We also study the maximum number of edges in both $k$-uniform and general hypergraphs not satisfying the $t$-EVP.<\/jats:p>","DOI":"10.37236\/3999","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T01:06:57Z","timestamp":1578704817000},"source":"Crossref","is-referenced-by-count":0,"title":["Equicovering Subgraphs of Graphs and Hypergraphs"],"prefix":"10.37236","volume":"21","author":[{"given":"Ilkyoo","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaehoon","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amelia","family":"Tebbe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas B.","family":"West","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2014,3,17]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v21i1p62\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v21i1p62\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T11:01:39Z","timestamp":1579258899000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v21i1p62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,17]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2014,1,13]]}},"URL":"https:\/\/doi.org\/10.37236\/3999","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2014,3,17]]},"article-number":"P1.62"}}