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

Abstract

Let T = (V, E) be a 3-uniform linear hypertree. We consider a blow-up hypergraph B[T ]. We are interested in the following problem. We have to decide whether there exists a blow-up hypergraph B[T ] of the hypertree T , with hyperedge densities satisfying some conditions, such that the hypertree 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 T in a blow-up hypergraph B[T ].

Authors and Affiliations

Halina Bielak, Kamil Powroźnik

Keywords

Related Articles

A survey of a selection of methods for determination of Koebe sets

In this article we take over methods for determination of Koebe set based on extremal sets for a given class of functions.

On l1-preduals distant by 1

For every predual X of l1 such that the standard basis in l1 is weak* convergent, we give explicit models of all Banach spaces Y for which the Banach–Mazur distance d(X, Y ) = 1. As a by-product of our considerations, we...

Eccentric distance sum index for some classes of connected graphs

In this paper we show some properties of the eccentric distance sum index which is defined as follows ξd(G)=∑v∈V(G)D(v)ε(v). This index is widely used by chemists and biologists in their researches. We present a lower bo...

Some new inequalities of Hermite–Hadamard type for GA-convex functions

Some new inequalities of Hermite–Hadamard type for GA-convex functions defined on positive intervals are given. Refinements and weighted version of known inequalities are provided. Some applications for special means are...

On branchwise commutative pseudo-BCH algebras

Basic properties of branches of pseudo-BCH algebras are described. Next, the concept of a branchwise commutative pseudo-BCH algebra is introduced. Some conditions equivalent to branchwise commutativity are given. It is p...

Download PDF file
  • EP ID EP530718
  • DOI 10.17951/a.2018.72.2.9
  • Views 110
  • Downloads 0

How To Cite

Halina Bielak, Kamil Powroźnik (2018). The density Turan problem for 3-uniform linear hypertrees. An efficient testing algorithm. Annales Universitatis Mariae Curie-Skłodowska. Sectio A, Mathematica, 72(2), 9-20. https://europub.co.uk/articles/-A-530718