Packing and covering tetrahedra

DOI10.1016/j.dam.2010.05.027zbMath1277.05138OpenAlexW2007055393MaRDI QIDQ385147

Penny E. Haxell, Subir Kumar Ghosh

Publication date: 29 November 2013

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.05.027

zbMATH Keywords

coveringsimplicial complexespacking

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of simplicial complexes (05E45)

Related Items (1)

Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number

Cites Work

• Unnamed Item
• Unnamed Item
• Maximum degree and fractional matchings in uniform hypergraphs
• Packing and covering triangles in graphs
• Packing and covering triangles in tripartite graphs
• Edge-disjoint odd cycles in planar graphs.
• On a conjecture of Tuza about packing and covering of triangles
• A conjecture on triangles of graphs

This page was built for publication: Packing and covering tetrahedra