Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Turan density

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm

100%

Bielak H., Powroźnik K.

Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica

2018

tom 72

nr 2

Let \(\mathcal{T}=(V,\mathcal{E})\) be a 3-uniform linear hypertree. We consider a blow-up hypergraph \(\mathcal{B}[\mathcal{T}]\). We are interested in the following problem. We have to decide whether there exists a blow-up hypergraph \(\mathcal{B}[\mathcal{T}]\) of the hypertree \(\mathcal{T}\), with hyperedge densities satisfying some conditions, such that the hypertree \(\mathcal{T}\) does not appear in a blow-up hypergraph as a transversal. We present an efficient algorithm to decide whether a given set of hyperedge densities ensures the existence of a 3-uniform linear hypertree \(\mathcal{T}\) in a blow-up hypergraph \(\mathcal{B}[\mathcal{T}]\).

Ograniczanie wyników

1 Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica

1 Bielak H.

1 Powroźnik K.

1 2018

Wyniki wyszukiwania

The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm