arXiv (OAI Expanded)
open access
Turán Number of Subdivisions of Multipartite Graphs
In this paper, we investigate the Turán exponent for $1$-subdivisions of graphs that are neither bipartite nor complete. Specifically, we establish an upper bound on the Turán number of the 1-subdivision of $K_{s,t}^+$, where $K_{s,t}^+$ is obtained by adding a single edge within the part of size $s
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
- Balanced even cycles in signed graphs:Turán bounds, double covers, and parity obstructions#998547
- Smallest Cubic Non-1-Planar Graphs#1063379
- Low-Degree Polynomial Approximation of the Cross-Polytope#1011346
- Analytic description of the phase transition of inhomogeneous multigraphs#652711
- NETCOM : Réseaux, communication et territoires / Networks and Communication Studies#23386
Record · ID 1122866
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