arXiv (All)
open access
Toughness Bounds for Fractional Hamiltonicity and Resistance Positivity
A graph is fractionally Hamiltonian if it admits a nonnegative edge weighting in $[0,1]$ of total weight equal to its order such that every nontrivial edge cut has weight at least two. Motivated by Chvátal's Toughness Conjecture, Scheinerman and Ullman conjectured that every $2$-tough graph is fract
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
- Valley polarization dependence of candidate even-denominator fractional quantum Hall states in monolayer graphene#925353
- Valley polarization dependence of candidate even-denominator fractional quantum Hall states in monolayer graphene#921117
- Explicit Fractalizers: Prime-Order Paley Graphs and other Cayley Graphs#1118238
- Permeability and microcrack geometry: Dynamic loading induced evolution#1130917
- Supplementary Data S1 for “Range-Dependent Performance of Id2 and DR2 and a Preliminary Six-Class Durability Classification for Soft Rocks”#614848
Record · ID 926335
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