Journal of Combinatorial Theory, Series BVolume 29, Issue 1, August 1980, Pages 106-115The enumeration problem for color critical linear hypergraphsAuthor links open overlay panelH.L Abbott a b, A Liu a b, B Toft a bShow moreShareCitehttps://doi.org/10.1016/0095-8956(80)90047-7Get rights and contentUnder an Elsevier user licenseopen archiveAbstractDenote by S(m, n, r) the number of non-isomorphic r-critical linear n-graphs on m vertices. It is shown that for n ≥ 3, r ≥ 3 there exists a constant c > 1 depending only on n and r such that S(m, n, r) > cm for all sufficiently large m.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1980 Published by Elsevier Inc.