Forestation in hypergraphs: Linear \(k\)-trees
From MaRDI portal
Publication:1408553
zbMath1024.05064MaRDI QIDQ1408553
Publication date: 24 September 2003
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/122991
Related Items
Some new bounds on partition critical hypergraphs, A new short proof of the EKR theorem, Smallest set-transversals of \(k\)-partitions