arXiv (All)
open access
The biwheel conjecture for braces
Let $b(n)$ denote the minimum number of perfect matchings in a simple brace of order $n$. De~Carvalho, Lucchesi and Murty (SIAM Journal on Discrete Mathematics, 27(2): (2013) 940-958) proved that $b(n)\ge(n-2)^2/8$ and conjectured that $b(n)=(n-2)^2/4$ for all sufficiently large even $n$. We prove t
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
- Exact and extremal values of chromatic villainy#1297932
- B-coloring of $K_{2,t}$-free planar graphs#1070014
- Strong edge coloring of graphs with maximum degree $6$#1119018
- Lower bounds for Ramsey numbers: $\mathrm{R}(6,8)\ge 135$ and $\mathrm{R}(8,10)\ge 345$#1249546
- Another Brick in the Wall: A Computationally Assisted Proof of an Improved Upper Bound for Thrackles#1342723
Record · ID 1297307
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