The density Turán problem for some 3-uniform unihypercyclic linear hypergraphs An efficient testing algorithm

Abstract

Let H = (V, E) be a 3-uniform linear hypergraph with one hypercycle C3. We consider a blow-up hypergraph B[H]. We are interested in the following problem. We have to decide whether there exists a blow-up hypergraph B[H] of the hypergraph H, with hyperedge densities satisfying special conditions, such that the hypergraph H appears 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 hypergraph H with hypercycle C3 in the blow-up hypergraph B[H]. Moreover, we state some relations between roots of the multivariate matching polynomial and the inhomogeneous density Turán problem.

DOI: 10.15439/2015F260

Extracted Key Phrases

10 Figures and Tables

Cite this paper

@inproceedings{Bielak2015TheDT, title={The density Tur{\'a}n problem for some 3-uniform unihypercyclic linear hypergraphs An efficient testing algorithm}, author={Halina Bielak and Kamil Powroznik}, booktitle={FedCSIS}, year={2015} }