The density Turán problem for some 3-uniform unihypercyclic linear hypergraphs. An efficient testing algorithm
Halina Bielak, Kamil Powroźnik
DOI: http://dx.doi.org/10.15439/2015F260
Citation: Proceedings of the 2015 Federated Conference on Computer Science and Information Systems, M. Ganzha, L. Maciaszek, M. Paprzycki (eds). ACSIS, Vol. 5, pages 563–571 (2015)
Abstract. Let $\mathcal{H}=(V,\mathcal{E})$ be a $3$-uniform linear hypergraph with one hypercycle $\mathcal{C}\_3$. We consider a blow-up hypergraph $\mathcal{B}[\mathcal{H}]$.