UM Research Repository
metadata only
On minimal regular graphs with given constraintsm
A classical question in graph theory has been the search of cages. The problem of determining the smallest (r,g)-cage is unsolved for most pairs of (r,g) and is extremely hard in the general case. Finding the crossing number of a graph is another challenging problem in graph theory. The crossing num
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
- Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor#998825
- The Erdős Matching Conjecture for 4-uniform hypergraphs#1070833
- Linear Tur'an Numbers of Four-Edge Uniform Paths via Incidence Rank#1033943
- Ramsey properties of maximal (outer)planar graphs#972204
- Spectral extremal hypergraphs without long Berge cycles#1051523
Record · ID 1041667
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