Hypergraph Based Berge Hypergraphs

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Hypergraph Based Berge Hypergraphs

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Hypergraph Based Berge Hypergraphs

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GJ19-04113Y" target="_blank" >GJ19-04113Y: Pokročilé nástroje v kombinatorice, topologii a příbuzných oblastech</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2022

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Graphs and Combinatorics

ISSN

0911-0119

e-ISSN

1435-5914

Svazek periodika

38

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

JP - Japonsko

Počet stran výsledku

13

Strana od-do

11

Kód UT WoS článku

000731914500019

EID výsledku v databázi Scopus

2-s2.0-85121426691