arXiv (All)
open access
Explicit Fractalizers: Prime-Order Paley Graphs and other Cayley Graphs
The inducibility problem asks for the maximum number of induced copies of a fixed graph among all graphs with a prescribed number of vertices. Inducibility has been an active area of research in extremal combinatorics, but determining all extremal graphs for explicitly defined patterns remains chall
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
- On $4$-perfect-matching covers of cubic graphs with two adjacent odd circuits in a $2$-factor#1105043
- PISA: Prioritized Invariant Subgraph Aggregation for Out-of-Distribution Generalization on Graphs#1141459
- Toughness Bounds for Fractional Hamiltonicity and Resistance Positivity#926335
- Multi-tier Flexible Graph Connectivity#792326
- Graph-Based Discovery of Mathematical Software Communities and Publication-to-Community Prediction#620843
Record · ID 1118238
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