arXiv (All)
open access
Ramsey Theory for Product Trees
We develop a Ramsey theory for leaf-generated subsets of finite products of trees. Our starting point is a Theorem of Furstenberg and Weiss which states that for every $k\geq 1$ and $α>0$, if $A$ is a subset of the leaves of $T_n$, where $T_n$ is the complete binary tree of height $n$, with size $|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
- Infinitely many size-Ramsey numbers of $k$-uniform relaxed $\ell$-trees are not polynomial#971390
- Infinitely many size-Ramsey numbers of $k$-uniform relaxed $\ell$-trees are not polynomial#965978
- On union-closed families with prescribed number of $k$-sets#998893
- The second-order term for the largest $r$-fork-free families#1104535
- Stabilization index of V-number of powers of edge ideals of graphs#987968
Record · ID 1076554
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