Logo PTI
Polish Information Processing Society
Logo FedCSIS

Annals of Computer Science and Information Systems, Volume 5

Proceedings of the 2015 Federated Conference on Computer Science and Information Systems

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

,

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 563571 ()

Full text

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}]$.