arXiv (All)
open access
Maximum index of unbalanced signed graphs without a positive odd cycle
Let $\mathcal{C}_{r}^+$ be the set of all balanced signed graphs with underlying graphs $C_r$. A signed graph is called $\mathcal{C}_{r}^+$-free if it contains no subgraph isomorphic to any member of $\mathcal{C}_{r}^+$. In this paper, we characterize the extremal graphs that achieve the maximum ind
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
- The Full P-vertex Problem and Perfect Matchings for Bipartite Graphs#987518
- The tree packing conjecture for trees of almost linear maximum degree#986755
- Extremal hypergraphs without generalized 4-cycles#1142055
- Odd and Even Harder Problems on Cycle-Factors#1104900
- Bounds on Longest Simple Cycles in Weighted Directed Graphs via Optimum Cycle Means#1048544
Record · ID 1326633
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