arXiv (All)
open access
Tree versus tree of preorder induced by rainbow forbidden subgraphs
A subgraph $H$ of an edge-colored graph $G$ is rainbow if all the edges of $H$ receive different colors. If $G$ does not contain a rainbow subgraph isomorphic to $H$, we say that $G$ is rainbow $H$-free. For connected graphs $H_1$ and $H_2$, if there exists an integer $t=t(H_1,H_2)$ such that every
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
- Types of well-founded trees and the homomorphism order#1049938
- From Linear to Branching-Time Temporal Logics: Transfer of Semantics and Definability#737207
- Canopy structure modulates the sensitivity of subalpine forest stands to interannual snowpack and precipitation variability#1157705
- Continuous change in Tanzanian moist forest tree communities with elevation#270921
- There are no nontrivial chordal square-complementary graphs#1076358
Record · ID 973026
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