BROWSE

Related Scientist

Researcher

Abhishek Methuku
수리 및 계산 과학 연구단
more info

On the weight of Berge-F-free hypergraphs

Cited 0 time in webofscience Cited 0 time in scopus
22 Viewed 3 Downloaded
Title
On the weight of Berge-F-free hypergraphs
Author(s)
English, S; Gerbner, D; Abhishek Methuku; Palmer, C
Publication Date
2019-12
Journal
ELECTRONIC JOURNAL OF COMBINATORICS, v.26, no.4, pp.P4.7 -
Publisher
ELECTRONIC JOURNAL OF COMBINATORICS
Abstract
For a graph F, we say a hypergraph is a Berge-F if it can be obtained from F by replacing each edge of F with a hyperedge containing it. A hypergraph is Berge-F-free if it does not contain a subhypergraph that is a Berge-F. The weight of a non-uniform hypergraph H is the quantity Sigma(h is an element of E(H)) vertical bar h vertical bar. Suppose H is a Berge-F-free hypergraph on n vertices. In this short note, we prove that as long as every edge of H has size at least the Ramsey number of F and at most o(n), the weight of H is o(n(2)). This result is best possible in some sense. Along the way, we study other weight functions, and strengthen results of Gerbner and Palmer; and Grosz, Methuku and Tompkins c The authors. Released under the CC BY-ND license (International 4.0).
URI
https://pr.ibs.re.kr/handle/8788114/6755
ISSN
1077-8926
Appears in Collections:
Pioneer Research Center for Mathematical and Computational Sciences(수리 및 계산과학 연구단) > Discrete Mathematics Group(이산 수학 그룹) > Journal Papers (저널논문)
Files in This Item:
On the weight of Berge-.pdfDownload

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