Pith. sign in

Title resolution pending

· 2016

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

math.CO 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Packing tetrahedrons in edge-weighted graphs

math.CO · 2025-06-08 · conditional · novelty 7.0

A minimum weighted degree above ((1+3t)/4)n suffices to force a perfect packing by K4s of total weight greater than 6t in every large edge-weighted complete graph.

citing papers explorer

Showing 1 of 1 citing paper.

  • Packing tetrahedrons in edge-weighted graphs math.CO · 2025-06-08 · conditional · none · ref 4

    A minimum weighted degree above ((1+3t)/4)n suffices to force a perfect packing by K4s of total weight greater than 6t in every large edge-weighted complete graph.