DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Jaehoon | ko |
dc.contributor.author | Kostochka, Alexandr V. | ko |
dc.date.accessioned | 2019-07-18T05:34:28Z | - |
dc.date.available | 2019-07-18T05:34:28Z | - |
dc.date.created | 2019-07-17 | - |
dc.date.created | 2019-07-17 | - |
dc.date.created | 2019-07-17 | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | DISCUSSIONES MATHEMATICAE GRAPH THEORY, v.34, no.1, pp.151 - 166 | - |
dc.identifier.issn | 1234-3099 | - |
dc.identifier.uri | http://hdl.handle.net/10203/263352 | - |
dc.description.abstract | We show that an n-vertex hypergraph with no r-regular subgraphs has at most 2(n-1) + r 2 edges. We conjecture that if n > r, then every n-vertex hypergraph with no r-regular subgraphs having the maximum number of edges contains a full star, that is, 2(n-1) distinct edges containing a given vertex. We prove this conjecture for n >= 425. The condition that n > r cannot be weakened. | - |
dc.language | English | - |
dc.publisher | UNIV ZIELONA GORA | - |
dc.title | MAXIMUM HYPERGRAPHS WITHOUT REGULAR SUBGRAPHS | - |
dc.type | Article | - |
dc.identifier.wosid | 000345241100013 | - |
dc.identifier.scopusid | 2-s2.0-84892657451 | - |
dc.type.rims | ART | - |
dc.citation.volume | 34 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 151 | - |
dc.citation.endingpage | 166 | - |
dc.citation.publicationname | DISCUSSIONES MATHEMATICAE GRAPH THEORY | - |
dc.identifier.doi | 10.7151/dmgt.1722 | - |
dc.contributor.localauthor | Kim, Jaehoon | - |
dc.contributor.nonIdAuthor | Kostochka, Alexandr V. | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | hypergraphs | - |
dc.subject.keywordAuthor | set system | - |
dc.subject.keywordAuthor | subgraph | - |
dc.subject.keywordAuthor | regular graph | - |
dc.subject.keywordPlus | DENSE GRAPHS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.