Hypergraph Based Berge Hypergraphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F22%3A10453256" target="_blank" >RIV/00216208:11320/22:10453256 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=FIwa.i~WVO" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=FIwa.i~WVO</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00373-021-02419-1" target="_blank" >10.1007/s00373-021-02419-1</a>
Alternative languages
Result language
angličtina
Original language name
Hypergraph Based Berge Hypergraphs
Original language description
Fix a hypergraph F. A hypergraph H is called a Berge copy of F or Berge-F if we can choose a subset of each hyperedge of H to obtain a copy of F. A hypergraph H is Berge-F-free if it does not contain a subhypergraph which is Berge copy of F. This is a generalization of the usual, graph-based Berge hypergraphs, where F is a graph. In this paper, we study extremal properties of hypergraph based Berge hypergraphs and generalize several results from the graph-based setting. In particular, we show that for any r-uniform hypergraph F, the sum of the sizes of the hyperedges of a (not necessarily uniform) Berge-F-free hypergraph H on n vertices is o(n(r)) when all the hyperedges of H are large enough. We also give a connection between hypergraph based Berge hypergraphs and generalized hypergraph Turan problems.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GJ19-04113Y" target="_blank" >GJ19-04113Y: Advanced tools in combinatorics, topology and related areas</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Graphs and Combinatorics
ISSN
0911-0119
e-ISSN
1435-5914
Volume of the periodical
38
Issue of the periodical within the volume
1
Country of publishing house
JP - JAPAN
Number of pages
13
Pages from-to
11
UT code for WoS article
000731914500019
EID of the result in the Scopus database
2-s2.0-85121426691