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

The natural operators of general affine connections into general affine connections

We reduce the problem of describing all Mfm-natural operators transforming general affine connections on m-manifolds into general affine ones to the known description of all GL(Rm)-invariant maps Rm∗⊗Rm→⊗kRm∗⊗⊗kRm for k...

Some properties for α-starlike functions with respect to k-symmetric points of complex order

In the present work, we introduce the subclass Tkγ,α(φ), of starlike functions with respect to k-symmetric points of complex order γ (γ≠0) in the open unit disc △. Some interesting subordination criteria, inclusion relat...

Properties of modulus of monotonicity and Opial property in direct sums

We give an example of a Banach lattice with a non-convex modulus of monotonicity, which disproves a claim made in the literature. Results on preservation of the non-strict Opial property and Opial property under passing...

Oscillation of third-order delay difference equations with negative damping term

The aim of this paper is to investigate the oscillatory and asymptotic behavior of solutions of a third-order delay difference equation. By using comparison theorems, we deduce oscillation of the difference equation from...

The Riemann-Cantor uniqueness theorem for unilateral trigonometric series via a special version of the Lusin-Privalov theorem

Using Baire's theorem, we give a very simple proof of a special version of the Lusin-Privalov theorem and deduce via Abel's theorem the Riemann-Cantor theorem on the uniqueness of the coefficients of pointwise converge...

Download PDF file
  • EP ID EP530718
  • DOI 10.17951/a.2018.72.2.9
  • Views 119
  • 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