arXiv (All)
open access
Balanced even cycles in signed graphs:Turán bounds, double covers, and parity obstructions
We study Turán problems for balanced even cycles in simple signed graphs, where signed subgraphs are considered up to switching. For every balanced bipartite signed graph, the signed and ordinary Turán numbers differ by at most a factor of two. Our main structural results concern the underlying grap
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
- Turán Number of Subdivisions of Multipartite Graphs#1122866
- A Tight Erdős-Stone Bound for All Graph Densities#821533
- Unbalanced spectral Turán problem for color-critical graphs with prescribed large maximum degree#821087
- Nonexistence of a Strongly Regular Graph with Parameters (266,45,0,9): A Certificate-Free Lean Proof#985683
- An improved lower bound for the packing number of the 2-token graph of the cycle#1115947
Record · ID 998547
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