Abstract
For Turán's (3, 4)-conjecture, in the case of $n = 3k+1$ vertices, ${1 \over 2}6^{k-1}$ non-isomorphic hypergraphs are constructed that attain the conjecture. In the case of $n = 3k+2$ vertices, $6^{k-1}$ non-isomorphic hypergraphs are constructed that attain the conjecture.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
