Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 3643
Articles: 2'487'895
Articles rated: 2609

28 March 2024
 
  » arxiv » 1902.3213

 Article overview


t-wise Berge and t-heavy hypergraphs
Dániel Gerbner ; Dániel T. Nagy ; Balázs Patkós ; Máté Vizer ;
Date 8 Feb 2019
AbstractIn many proofs concerning extremal parameters of Berge hypergraphs one starts with analyzing that part of that shadow graph which is contained in many hyperedges. Capturing this phenomenon we introduce two new types of hypergraphs. A hypergraph $mathcal{H}$ is a $t$-heavy copy of a graph $F$ if there is a copy of $F$ on its vertex set such that each edge of $F$ is contained in at least $t$ hyperedges of $mathcal{H}$. $mathcal{H}$ is a $t$-wise Berge copy of $F$ if additionally for distinct edges of $F$ those $t$ hyperedges are distinct.
We extend known upper bounds on the Tur’an number of Berge hypergraphs to the $t$-wise Berge hypergraphs case. We asymptotically determine the Tur’an number of $t$-heavy and $t$-wise Berge copies of long paths and cycles and exactly determine the Tur’an number of $t$-heavy and $t$-wise Berge copies of cliques.
In the case of 3-uniform hypergraphs, we consider the problem in more details and obtain additional results.
Source arXiv, 1902.3213
Services Forum | Review | PDF | Favorites   
 
Visitor rating: did you like this article? no 1   2   3   4   5   yes

No review found.
 Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

  Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser claudebot






ScienXe.org
» my Online CV
» Free


News, job offers and information for researchers and scientists:
home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2024 - Scimetrica