BROWSE

Related Scientist

Abhishek, Methuku's photo.

Abhishek, Methuku
이산수학 그룹
more info

ITEM VIEW & DOWNLOAD

General lemmas for Berge–Turán hypergraph problems

DC Field Value Language
dc.contributor.authorGerbner D.-
dc.contributor.authorAbhishek Methuku-
dc.contributor.authorPalmer C.-
dc.date.accessioned2021-01-19T02:30:01Z-
dc.date.accessioned2021-01-19T02:30:01Z-
dc.date.available2021-01-19T02:30:01Z-
dc.date.available2021-01-19T02:30:01Z-
dc.date.created2020-02-19-
dc.date.issued2020-05-
dc.identifier.issn0195-6698-
dc.identifier.urihttps://pr.ibs.re.kr/handle/8788114/9074-
dc.description.abstractFor a graph F, a hypergraph H is a Berge copy of F (or a Berge-F in short), if there is a bijection f:E(F)→E(H) such that for each e∈E(F) we have e⊂f(e). A hypergraph is Berge-F-free if it does not contain a Berge copy of F. We denote the maximum number of hyperedges in an n-vertex r-uniform Berge-F-free hypergraph by exr(n,Berge-F). In this paper we prove two general lemmas concerning the maximum size of a Berge-F-free hypergraph and use them to establish new results and improve several old results. In particular, we give bounds on exr(n,Berge-F) when F is a path (reproving a result of Győri, Katona and Lemons), a cycle (extending a result of Füredi and Özkahya), a theta graph (improving a result of He and Tait), or a K2,t (extending a result of Gerbner, Methuku and Vizer). We establish new bounds when F is a clique (which implies extensions of results by Maherani and Shahsiah and by Gyárfás) and when F is a general tree-
dc.description.uri1-
dc.language영어-
dc.publisherElsevier-
dc.titleGeneral lemmas for Berge–Turán hypergraph problems-
dc.typeArticle-
dc.type.rimsART-
dc.identifier.wosid000527928900010-
dc.identifier.scopusid2-s2.0-85078103547-
dc.identifier.rimsid71295-
dc.contributor.affiliatedAuthorAbhishek Methuku-
dc.identifier.doi10.1016/j.ejc.2020.103082-
dc.identifier.bibliographicCitationEuropean Journal of Combinatorics, v.86-
dc.citation.titleEuropean Journal of Combinatorics-
dc.citation.volume86-
dc.description.journalClass1-
dc.description.isOpenAccessN-
dc.description.journalRegisteredClassscie-
dc.description.journalRegisteredClassscopus-
dc.subject.keywordPlus3-UNIFORM HYPERGRAPHS-
dc.subject.keywordAuthor3-UNIFORM HYPERGRAPHS-
Appears in Collections:
Pioneer Research Center for Mathematical and Computational Sciences(수리 및 계산과학 연구단) > Discrete Mathematics Group(이산 수학 그룹) > 1. Journal Papers (저널논문)
Files in This Item:
There are no files associated with this item.

qrcode

  • facebook

    twitter

  • Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
해당 아이템을 이메일로 공유하기 원하시면 인증을 거치시기 바랍니다.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse