HAL (France)
open access
Ramsey achievement games on graphs : algorithms and bounds
In 1982, Harary introduced the concept of Ramsey achievement game on graphs. Given a graph F with no isolated vertices, consider the following game played on the complete graph K n by two players Alice and Bob. First, Alice colors one of the edges of K n blue, then Bob colors a different edge red, a
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
- Graph theory: From Euler to modern application#701384
- The 11/6 supremum of the Wang-Sitters rounding scheme for graph balancing#998384
- Polynomially superlinear growth of set-coloring Ramsey numbers#1129681
- Ramsey properties of maximal (outer)planar graphs#972204
- Graph Theory: Fundamental and Applications in Mathematics#119203
Record · ID 796468
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