arXiv (All)
open access
Locally bipartite subgraphs via multicolor Ramsey numbers
A famous conjecture of Erdős and Hajnal (1969) states that for every integer $g\ge 4$ there is a smallest function $f_g:\mathbb{N}\to\mathbb{N}$ such that every graph of chromatic number at least $f_g(k)$ contains a subgraph of chromatic number $k$ and girth at least $g$. So far, this has only been
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
- Chromatic Extremal Thresholds and the Multipartite $K_4$-Free Problem#1064047
- An Optimal Bound for Ramsey Goodness of Cycles#799017
- An Optimal Bound for Ramsey Goodness of Cycles#797602
- Majority C-coloring in Cartesian products#780968
- Majority C-coloring in Cartesian products#779593
Record · ID 984213
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