Forestation in hypergraphs: Linear \(k\)-trees

zbMath1024.05064MaRDI QIDQ1408553

Ojas Parekh

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

Mathematics Subject Classification ID

Hypergraphs (05C65) Algebraic combinatorics (05E99)

Related Items (3)

Some new bounds on partition critical hypergraphs ⋮ A new short proof of the EKR theorem ⋮ Smallest set-transversals of \(k\)-partitions

This page was built for publication: Forestation in hypergraphs: Linear \(k\)-trees