Pith. sign in

Title resolution pending

· 2016 · DOI 10.1016/j.ejc.2015.08

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

1 Pith paper citing it
open at publisher 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

CONDITIONAL 1

representative citing papers

Characterizing graphs with high inducibility

math.CO · 2024-11-26 · conditional · novelty 7.0

Except for the star and the single-edge graph, every other graph has inducibility at most c + o_k(1) for a fixed c < 1/e, and graphs with inducibility bounded away from zero are exactly those with a bounded-size taming set.

citing papers explorer

Showing 1 of 1 citing paper.

  • Characterizing graphs with high inducibility math.CO · 2024-11-26 · conditional · none · ref 2

    Except for the star and the single-edge graph, every other graph has inducibility at most c + o_k(1) for a fixed c < 1/e, and graphs with inducibility bounded away from zero are exactly those with a bounded-size taming set.