Packing and covering tetrahedra

DOI10.1016/J.DAM.2010.05.027MaRDI QIDQ385147zbMATH OpenOpenAlexFDO

Authors Penny 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

simplicial complexescoveringpacking

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)

Recommendations

• Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
• Packings and coverings of complete 3-uniform hypergraph
• Integer and fractional packings in dense 3‐uniform hypergraphs
• A generalization of Tuza's conjecture
• A note on geometric 3-hypergraphs

Cites work

• scientific article; zbMATH DE number 3854804 (Why is no real title available?)
• scientific article; zbMATH DE number 3891262 (Why is no real title available?)
• A conjecture on triangles of graphs
• Edge-disjoint odd cycles in planar graphs.
• Maximum degree and fractional matchings in uniform hypergraphs
• On a conjecture of Tuza about packing and covering of triangles
• Packing and covering triangles in graphs
• Packing and covering triangles in tripartite graphs

Cited in

(7)

• scientific article; zbMATH DE number 6139732 (Why is no real title available?)
• Packing of convex polytopes into a parallelepiped
• A note on geometric 3-hypergraphs
• The caterpillar-packing polytope
• Mysteries in Packing Regular Tetrahedra
• Triangle-degrees in graphs and tetrahedron coverings in 3-graphs
• Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number

This page was built for publication: Packing and covering tetrahedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385147)