grant

Extremal Problems Related to Cycles and Spanning Structures in Graphs and Hypergraphs

Organization University of South Carolina at ColumbiaLocation COLUMBIA, United StatesPosted 1 Aug 2025Deadline 31 Jul 2028
NSFUS FederalResearch GrantScience FoundationSC
Sign up free to applyApply link · pipeline · email alerts
— or —

Get email alerts for similar roles

Weekly digest · no password needed · unsubscribe any time

Description preview

The basic problem of extremal combinatorics asks how large a combinatorial structure can be while avoiding some forbidden property. This project studies extremal problems in graph theory and hypergraph theory, specifically those related to long paths and cycles. Of particular interest are Hamiltonian cycles--cycles that visit every vertex in a…

🔒

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.

Start 7-day free trial — $29.99/mo →

Agency Plan

7-day free trial

Unlock 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
Start 7-day free trial →

Explore more

📍 More grants in United States🏷 More NSF opportunities🏷 More US Federal opportunities🏷 More Research Grant opportunities🏢 All nsf_awards opportunities
Extremal Problems Related to Cycles and Spanning Structures in Graphs and Hypergraphs — University of South Carolina at | Dev Procure