arXiv (All)
open access
Duality and $χ^<$-Boundedness of Ordered Graphs
We show that there exists only one duality pair for ordered graphs. We will also define a corresponding definition of $χ^<$-boundedness for ordered graphs and show that all ordered graphs are $χ^<$-bounded and prove an analogy of Gyárfás-Sumner conjecture for ordered graphs. We also prove an analogy
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
- Unavoidable induced subgraphs forced by graphs with many vertices of prescribed properties#1122975
- A Proof of Albertson's Conjecture#1084360
- Ramsey achievement games on graphs : algorithms and bounds#796468
- Graph Theory: Fundamental and Applications in Mathematics#119203
- Plain Transformers Can be Powerful Graph Learners#677368
Record · ID 1115458
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