Packing and covering tetrahedra

DOI10.1016/J.DAM.2010.05.027zbMATH Open1277.05138OpenAlexW2007055393MaRDI QIDQ385147FDOQ385147

Subir Kumar Ghosh, Penny Haxell

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)

Cites Work

• Title not available (Why is that?)
• Packing and covering triangles in tripartite graphs
• On a conjecture of Tuza about packing and covering of triangles
• A conjecture on triangles of graphs
• Edge-disjoint odd cycles in planar graphs.
• Maximum degree and fractional matchings in uniform hypergraphs
• Packing and covering triangles in graphs
• Title not available (Why is that?)

Cited In (5)

• Mysteries in Packing Regular Tetrahedra
• The caterpillar-packing polytope
• Packing of convex polytopes into a parallelepiped
• Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
• Title not available (Why is that?)

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)