pith. sign in

Title resolution pending

· 1997

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

2019 1

verdicts

UNVERDICTED 1

representative citing papers

A rainbow blow-up lemma for almost optimally bounded edge-colourings

math.CO · 2019-07-23 · unverdicted · novelty 7.0

Proves a rainbow blow-up lemma for almost optimally bounded edge-colorings, implying existence of rainbow copies of any bounded-degree spanning subgraph in a quasirandom host graph under an asymptotically best-possible coloring boundedness condition.

citing papers explorer

Showing 1 of 1 citing paper.

  • A rainbow blow-up lemma for almost optimally bounded edge-colourings math.CO · 2019-07-23 · unverdicted · none · ref 21

    Proves a rainbow blow-up lemma for almost optimally bounded edge-colorings, implying existence of rainbow copies of any bounded-degree spanning subgraph in a quasirandom host graph under an asymptotically best-possible coloring boundedness condition.