grant
Optimal Edge Decomposition of Graphs and Hamiltonicity of Tough Expanders
NSFUS FederalResearch GrantScience FoundationAL
Description preview
This proposal centers on two core themes: the optimal decomposition of a graph's edges into matchings, and the Hamiltonicity problem in tough graphs with some “expansion” properties. The decomposition of the edges of a graph into non-conflicting groups, such as matchings, is deeply rooted in combinatorial theory and holds practical significance…
🔒
Start 7-day free trial — $29.99/mo →Full details available on the Agency plan
Unlock the complete grant description, eligibility criteria, contract value, evaluation details and apply link — plus alerts, pipeline tracking, and CSV export.
Agency Plan
7-day free trialUnlock procurement & grants
Upgrade to access active tenders from World Bank, UNDP, ADB and more — with email alerts and pipeline tracking.
$29.99 / month
- 🔔Email alerts for new matching tenders
- 🗂️Track tenders in your pipeline
- 💰Filter by contract value
- 📥Export results to CSV
- 📌Save searches with one click