0 references
The density Turán problem for some 3-uniform unihypercyclic linear hypergraphs. An efficient testing algorithm
Annals of Computer Science and Information Systems2015Vol. 5, pp. 563–571
Abstract
Let H = (V, E ) be a 3-uniform linear hypergraph with one hypercycle C3. We consider a blow-up hypergraph B[H].
Related Papers
- → Hypergraph Transversal Computation and Related Problems in Logic and AI(2002)120 cited
- → Some results about Hypergraph(2016)2 cited
- → Study, representation and applications of hypergraph minimal transversals(2019)1 cited
- Transversal of a Hypergraph(2011)
- → ИСПОЛЬЗОВAНИЕ ПОТЕНЦИAЛA СОЦИAЛЬНЫХ ПAРТНЕРОВ В ПОДГОТОВКЕ БУДУЩИХ ПЕДAГОГОВ(2024)