MAXIMUM HYPERGRAPHS WITHOUT REGULAR SUBGRAPHS

Cited 5 time in webofscience Cited 4 time in scopus
  • Hit : 189
  • Download : 0
DC FieldValueLanguage
dc.contributor.authorKim, Jaehoonko
dc.contributor.authorKostochka, Alexandr V.ko
dc.date.accessioned2019-07-18T05:34:28Z-
dc.date.available2019-07-18T05:34:28Z-
dc.date.created2019-07-17-
dc.date.created2019-07-17-
dc.date.created2019-07-17-
dc.date.issued2014-
dc.identifier.citationDISCUSSIONES MATHEMATICAE GRAPH THEORY, v.34, no.1, pp.151 - 166-
dc.identifier.issn1234-3099-
dc.identifier.urihttp://hdl.handle.net/10203/263352-
dc.description.abstractWe 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.languageEnglish-
dc.publisherUNIV ZIELONA GORA-
dc.titleMAXIMUM HYPERGRAPHS WITHOUT REGULAR SUBGRAPHS-
dc.typeArticle-
dc.identifier.wosid000345241100013-
dc.identifier.scopusid2-s2.0-84892657451-
dc.type.rimsART-
dc.citation.volume34-
dc.citation.issue1-
dc.citation.beginningpage151-
dc.citation.endingpage166-
dc.citation.publicationnameDISCUSSIONES MATHEMATICAE GRAPH THEORY-
dc.identifier.doi10.7151/dmgt.1722-
dc.contributor.localauthorKim, Jaehoon-
dc.contributor.nonIdAuthorKostochka, Alexandr V.-
dc.description.isOpenAccessN-
dc.type.journalArticleArticle-
dc.subject.keywordAuthorhypergraphs-
dc.subject.keywordAuthorset system-
dc.subject.keywordAuthorsubgraph-
dc.subject.keywordAuthorregular graph-
dc.subject.keywordPlusDENSE GRAPHS-
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 5 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0