Pith. sign in

Title resolution pending

· 1990 · Algorithms and combinatorics · DOI 10.1007/978-3-642-72905-8_15

1 Pith paper cite this work, alongside 12 external citations. Polarity classification is still indexing.

1 Pith paper citing it
12 external citations · OpenAlex
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

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Unavoidable subgraphs in Ramsey graphs

math.CO · 2025-02-14 · conditional · novelty 7.0

For cycles and balanced complete multipartite graphs, every forest of copies of F is forced in large Ramsey graphs, but infinitely many graphs F admit Ramsey graphs that avoid all non-trivial such forests.

citing papers explorer

Showing 1 of 1 citing paper.

  • Unavoidable subgraphs in Ramsey graphs math.CO · 2025-02-14 · conditional · none · ref 5

    For cycles and balanced complete multipartite graphs, every forest of copies of F is forced in large Ramsey graphs, but infinitely many graphs F admit Ramsey graphs that avoid all non-trivial such forests.