Skip to Main content Skip to Navigation
Journal articles

Random Horn formulas and propagation connectivity for directed hypergraphs

Abstract : We consider the property that in a random definite Horn formula of size-3 clauses over n variables, where every such clause is included with probability p, there is a pair of variables for which forward chaining produces all other variables. We show that with high probability the property does not hold for p <= 1/(11n ln n), and does hold for p >= (5 1n ln n)/(n ln n).
Document type :
Journal articles
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Tuesday, May 13, 2014 - 4:27:36 PM
Last modification on : Tuesday, November 26, 2019 - 4:12:08 PM
Long-term archiving on: : Monday, April 10, 2017 - 10:28:20 PM


Files produced by the author(s)




Robert H. Sloan, Despina Stasi, György Turán. Random Horn formulas and propagation connectivity for directed hypergraphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2012, Vol. 14 no. 2 (2), pp.29--35. ⟨10.46298/dmtcs.578⟩. ⟨hal-00990587⟩



Record views


Files downloads