Pith. sign in

Title resolution pending

· 2024

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

On forest and bipartite cuts in sparse graphs

math.CO · 2025-05-22 · conditional · novelty 6.0

Any connected graph with fewer than (19n-28)/8 edges has a forest cut, and any graph with fewer than (80n-134)/31 edges has a bipartite cut.

citing papers explorer

Showing 1 of 1 citing paper.

  • On forest and bipartite cuts in sparse graphs math.CO · 2025-05-22 · conditional · none · ref 4

    Any connected graph with fewer than (19n-28)/8 edges has a forest cut, and any graph with fewer than (80n-134)/31 edges has a bipartite cut.