arXiv (All)
open access
Ramsey-type results for Maker-Breaker games
A graph $G$ is minimal Ramsey for a graph $H$ if every $2$-colouring of the edges of $G$ contains a monochromatic copy of $H$, but for every proper subgraph of $G$, there is a $2$-colouring that does not contain such a monochromatic copy. Characterizing minimal Ramsey graphs is a widely studied prob
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-type results for Maker-Breaker games#920507
- Ramsey properties of maximal (outer)planar graphs#972204
- Graph Coloring with Color Preferences#820007
- $(2,\mathcal{F})$-Avoiding Coloring and B-Coloring under Bipartite Exclusions#1144883
- Structural Reductions for Monochromatic Matchings and Ramsey Tilings#652365
Record · ID 924741
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