arXiv (All)
open access
Generalized regular Turán numbers
We combine two generalizations of ordinary Turán problems. Given graphs $H$ and $F$ and a positive integer $n$, we study $rex(n, H, F )$, which is the largest number of copies of $H$ in $F$-free regular $n$-vertex graphs.
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
- Generalized regular Turán numbers#783440
- A Complete Proof of the Strong Conjecture about $F$-Irregular Graphs#1013843
- Compactness of abundance in asymmetric hypergraph removal lemmas#800112
- Extremal graphs with prescribed covering number#490228
- On the Burning Game: Nordhaus-Gaddum Bounds and Graph Products#1142856
Record · ID 785030
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