arXiv (All)
open access
Threshold Ramsey multiplicity and extremal colorings for odd cycles
The Ramsey number $r(H)$ of a graph $H$ is the minimum positive integer $n$ such that every red/blue edge-coloring of the complete graph $K_n$ on $n$ vertices contains a monochromatic copy of $H$. The threshold Ramsey multiplicity $m(H)$ of $H$ is the minimum number of monochromatic copies of $H$ ov
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Ramsey multiplicity and extremal colorings for odd cycles#1136549
- Erdős-Hajnal conjecture beyond five-vertex graphs#798944
- Erdős-Hajnal conjecture beyond five-vertex graphs#797530
- On Alon's problem concerning the difference between connected domination number and domination number#1077551
- Ramsey Theory for Product Trees#1076554
Record · ID 975336
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive