Pith. sign in

Title resolution pending

· 1981

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

2024 1

verdicts

ACCEPT 1

representative citing papers

Tree tilings in random regular graphs

math.CO · 2024-12-27 · accept · novelty 8.0

For every fixed epsilon, with high probability the random d-regular graph contains a vertex-partition into copies of any prescribed tree of size at most (1-epsilon)d/ln d.

citing papers explorer

Showing 1 of 1 citing paper.

  • Tree tilings in random regular graphs math.CO · 2024-12-27 · accept · none · ref 5

    For every fixed epsilon, with high probability the random d-regular graph contains a vertex-partition into copies of any prescribed tree of size at most (1-epsilon)d/ln d.