arXiv (All)
open access
An Ore-type Theorem for Oriented Discrepancy of Hamilton Cycles
Oriented graph discrepancy problems focus on finding specific subgraphs within a given oriented graph $G$ that contain a significant number of edges in one direction. Gishboliner, Krivelevich, and Michaeli initiated the study of oriented discrepancy for Hamilton cycles, and Freschi and Lo subsequent
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
- Long Cycles in 2-Connected Tough Graphs#1000101
- Solving the Hamilton cycle problem fast on average#476218
- Zero-Defect Algebraization from First Principles: A Complete Unconditional Closure of the Hodge Conjecture#696261
- Decreasing collectivity in smoothly terminating bands in the A ∼ 110 region#461585
- Crooked Trails#34870
Record · ID 1049776
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