Maximal Independent Sets in Long Graph Subdivisions
We study maximal independent sets in finite simple graphs whose edges are replaced by paths with prescribed numbers of internal vertices. Using established finite-state transfer methods, we derive an exact boundary-state formula and an explicit leading asymptotic term that factors over the degrees of the original vertices. A graph-uniform relative error bound gives a sufficient condition for this approximation to remain valid when the base graph grows. Under the same condition, the joint membership indicators of the original vertices approach an explicit product of Bernoulli distributions in…
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2610.00663
curl -X POST /api/v1/records/hexagon/2610.00663/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2610.00663/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'