DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Jaehoon | ko |
dc.date.accessioned | 2019-07-18T05:34:15Z | - |
dc.date.available | 2019-07-18T05:34:15Z | - |
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 | 2016-07 | - |
dc.identifier.citation | JOURNAL OF COMBINATORIAL THEORY SERIES B, v.119, pp.214 - 236 | - |
dc.identifier.issn | 0095-8956 | - |
dc.identifier.uri | http://hdl.handle.net/10203/263345 | - |
dc.description.abstract | We prove that for every integer r >= 2, an n-vertex k-uniform hypergraph H containing no r-regular subgraphs has at most (1 + o(1)) [GRAPHICS] edges if k >= r + 1 and n is sufficiently large. Moreover, if r is an element of {3, 4}, r vertical bar k and k, n are both sufficiently large, then the maximum number of edges in an n-vertex k-uniform hypergraph containing no r-regular subgraphs is exactly [GRAPHICS] , with equality only if all edges contain a specific vertex v. We also ask some related questions. (C) 2016 Elsevier Inc. All rights reserved. | - |
dc.language | English | - |
dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
dc.title | Regular subgraphs of uniform hypergraphs | - |
dc.type | Article | - |
dc.identifier.wosid | 000375170900010 | - |
dc.identifier.scopusid | 2-s2.0-84962254912 | - |
dc.type.rims | ART | - |
dc.citation.volume | 119 | - |
dc.citation.beginningpage | 214 | - |
dc.citation.endingpage | 236 | - |
dc.citation.publicationname | JOURNAL OF COMBINATORIAL THEORY SERIES B | - |
dc.identifier.doi | 10.1016/j.jctb.2016.03.001 | - |
dc.contributor.localauthor | Kim, Jaehoon | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Matchings | - |
dc.subject.keywordAuthor | Hypergraphs | - |
dc.subject.keywordAuthor | Regular subgraphs | - |
dc.subject.keywordAuthor | Stability | - |
dc.subject.keywordPlus | DENSE GRAPHS | - |
dc.subject.keywordPlus | SYSTEMS | - |
dc.subject.keywordPlus | SIZE | - |
dc.subject.keywordPlus | SETS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.