arXiv (OAI Expanded)
open access
Infinite Games and Ramsey Properties of $F_σ$ Ideals
We study combinatorial properties of Borel ideals on countable sets. We construct a tall $F_σ$ ideal for which player II has a winning strategy in the cut-and-choose game, answering a question of J. Zapletal. We also generalize the characterization of Ramsey properties by the random graph ideal to i
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
- Frobenius methods in combinatorics#823164
- On union-closed families with prescribed number of $k$-sets#998893
- A Nearly Tight Lower Bound for Matroid Intersection Prophet Inequalities#1034496
- Eleven, twelve, and thirteen lonely runners#819353
- Eleven, twelve, and thirteen lonely runners#809360
Record · ID 1082888
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