arXiv (All)
open access
From finding a spanning subgraph $H$ to an $H$-factor
A typical Dirac-type problem in extremal graph theory is to determine the minimum degree threshold for a graph $G$ to have a spanning subgraph $H$, e.g. the Dirac theorem. A natural follow-up problem is to seek an $H$-factor, which is a spanning set of vertex-disjoint copies of $H$. In this short no
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
- A structure theory for signed graphs with fixed smallest eigenvalue#677502
- A structure theory for signed graphs with fixed smallest eigenvalue#674304
- The Compressive Knowledge Graph Hypothesis: Which Graph Facts Matter for Scientific Hypothesis Generation?#229542
- Long Cycles in 2-Connected Tough Graphs#1000101
- Generalized Turán problems for shorter even cycles#1141698
Record · ID 1143625
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