arXiv (All)
open access
The strong (non-induced) Turán numbers
In this paper we introduce and explore the following new graph invariant: For a graph $G$ on $k$ vertices, $G \neq K_k$, let $st(n,G)$ denote the maximum number of edges in a graph of order $n$ which does not contain any subgraph on $k$ vertices strictly containing $G$. A basic relation to classic
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
- Bipartite Turán Numbers of Trees and Star Forests#1118674
- Turán problems with bounded matching number in $k$-uniform hypergraphs#1050532
- An Efficiently Computable Lower Bound for the Independence Number of Hypergraphs#1011997
- The tree packing conjecture for trees of almost linear maximum degree#986755
- Asymptotics of the Brown--Erdős--Sós problem at integer exponents#1142411
Record · ID 1077233
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