DC Field | Value | Language |
---|---|---|
dc.contributor.author | Han, Jie | ko |
dc.contributor.author | Kim, Jaehoon | ko |
dc.date.accessioned | 2019-07-18T05:34:12Z | - |
dc.date.available | 2019-07-18T05:34:12Z | - |
dc.date.created | 2019-07-17 | - |
dc.date.created | 2019-07-17 | - |
dc.date.created | 2019-07-17 | - |
dc.date.created | 2019-07-17 | - |
dc.date.created | 2019-07-17 | - |
dc.date.issued | 2018-01 | - |
dc.identifier.citation | JOURNAL OF COMBINATORIAL THEORY SERIES B, v.128, pp.175 - 191 | - |
dc.identifier.issn | 0095-8956 | - |
dc.identifier.uri | http://hdl.handle.net/10203/263343 | - |
dc.description.abstract | Let k >= 3 be an odd integer and let n be a sufficiently large integer. We prove that the maximum number of edges in an n-vertex k-uniform hypergraph containing no 2-regular subgraphs is ((n-1)(k-1)) + left perpendicular n-1/k right perpendicular, and the equality holds if and only if H is a full k-star with center v together with a maximal matching omitting v. This verifies a conjecture of Mubayi and Verstraete. (C) 2017 Elsevier Inc. All rights reserved. | - |
dc.language | English | - |
dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
dc.title | Two-regular subgraphs of odd-uniform hypergraphs | - |
dc.type | Article | - |
dc.identifier.wosid | 000417771100010 | - |
dc.identifier.scopusid | 2-s2.0-85029215621 | - |
dc.type.rims | ART | - |
dc.citation.volume | 128 | - |
dc.citation.beginningpage | 175 | - |
dc.citation.endingpage | 191 | - |
dc.citation.publicationname | JOURNAL OF COMBINATORIAL THEORY SERIES B | - |
dc.identifier.doi | 10.1016/j.jctb.2017.08.009 | - |
dc.contributor.localauthor | Kim, Jaehoon | - |
dc.contributor.nonIdAuthor | Han, Jie | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Hypergraph | - |
dc.subject.keywordAuthor | Subgraph | - |
dc.subject.keywordAuthor | Regular graph | - |
dc.subject.keywordAuthor | Regular subgraph | - |
dc.subject.keywordPlus | REGULAR SUBGRAPHS | - |
dc.subject.keywordPlus | DENSE GRAPHS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.