arXiv (All)
open access
Perfect matchings in planar 3-connected graphs: girth five and minimum degree five
Let $Φ(G)$ denote the number of perfect matchings of a graph $G$. Goedgebeur et al. posted two questions about the perfect matchings of planar 3-connected graphs: does there exist an infinite family of matchable planar 3-connected graphs of girth 5 with a constant number of perfect matchings? Whethe
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
- Degreewise Cut-Semigroup Saturation for $K_5$-Minor-Free Graphs and Seymour's Planar Edge-Colouring Conjecture#1070206
- On Perfect Divisibility of Bull-Free Graphs Without Long Paths#1034674
- Sufficient conditions for a digraph to contain: a pre-Hamiltonian cycle and cycles of lengths 3 and 4#1049695
- Constrained Ramsey numbers for rainbow $P_5$#1129129
- Long induced paths in sparse graphs and graphs with forbidden patterns#925730
Record · ID 1341537
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