Project Grant 2452103
Award Date 9/1/25
Completion Date 8/31/28
Dollars Obligated $265K
Federal Agency
Federal Grant Program
Assistance Type
Project Grant
Place of Performance
Auburn University, AL 36849, USA
Similar Awards
- This $250,136 Project Grant award was provided by the National Science Foundation (NSF) under the Mathematical and Physical Sciences Federal Grant Program (CFDA 47.049). The grant supports fundamental and applied research at Auburn University in two core areas: optimal decomposition of graph edges into matchings, and the study of Hamiltonicity in "tough" graphs with expansion properties. The research aims to advance combinatorial theory with practical applications in fields like...
- The National Science Foundation (NSF) awarded a $260,846 Project Grant under the Mathematical and Physical Sciences (MPS) program (CFDA 47.049) to the Georgia Tech Research Corporation (Georgia Tech) for research on graph coloring and graph structure. This three-year project (6/1/2024 - 5/31/2027) will investigate the existence of certain graph configurations and their connections to global graph properties, building on prior work on the Four Color Theorem and related conjectures. The research...
- This Project Grant award from the National Science Foundation's (NSF) Mathematical and Physical Sciences program (CFDA 47.049) provides $137,955.00 to the University of Massachusetts Lowell to conduct research on density and algorithms in edge coloring and packing of graphs. The research will explore the theory and develop efficient algorithms for edge coloring and packing, with a focus on density-related techniques such as the generalized Tashkinov tree and generalized Kempe change method....
- This $179,870 project grant from the National Science Foundation's Mathematical and Physical Sciences program (CFDA 47.049) will support research into graph edge coloring at Georgia State University Research Foundation from August 2022 through July 2025. The principal investigator and collaborators will determine families of graphs whose chromatic index can be computed in polynomial time, aiming to show that commonly known families such as simple graphs with large maximum degrees, all planar...
- This Project Grant from the National Science Foundation's Division of Mathematical Sciences, under the Mathematical and Physical Sciences program (CFDA 47.049), provides $205,601 to the University of Massachusetts for research related to enumerative, algebraic, and asymptotic combinatorics with connections to representation theory and geometry. Specifically, the award supports three research projects that will study problems in graph colorings, Schubert polynomials, and integer flows on graphs...
- This $150,000 Project Grant awarded by the National Science Foundation's (NSF) Division of Mathematical Sciences under the Mathematical and Physical Sciences Federal Grant Program (CFDA 47.049) supports research on structural techniques for dense classes of graphs. The project, led by the Georgia Tech Research Corporation, will focus on developing a comprehensive understanding of graph structure, specifically by studying classes with a forbidden vertex-minor or a dependent first-order theory....
- This three-year, $130,029 National Science Foundation project grant supports mathematical research on optimizing local graph conditions to force global structural properties. The awardee, University of South Florida, will investigate extremal combinatorics questions regarding graphs and directed graphs using probabilistic methods including the absorbing technique and regularity method. Graduate students will assist with research to support their professional development. Outcomes will further...
- The National Science Foundation (NSF), through its Mathematical and Physical Sciences Federal Grant Program (CFDA 47.049), awarded a $290,000 project grant to Auburn University. The purpose of this 3-year project, which runs from September 15, 2025 to August 31, 2028, is to develop advanced computational approaches for accurately simulating complex compressible fluid flows in practical engineering domains. This research will eliminate the need for complex mesh generation while ensuring...
- The National Science Foundation (NSF) awarded Villanova University a $210,000 Project Grant under the Mathematical and Physical Sciences program (CFDA 47.049) to conduct research in spectral and extremal graph theory. The three-year project focuses on two main thrusts: 1) studying classical Turán and Ramsey theory, which are central areas in combinatorics, and 2) investigating extremal problems in spectral graph theory using linear algebra to deduce combinatorial properties of graphs. The...
- This Project Grant award of $148,127 was provided by the National Science Foundation (NSF) under the Mathematical and Physical Sciences (CFDA 47.049) federal grant program. The grant focuses on developing efficient and reliable methods for finding optimal balanced graph cuts, which have applications in materials science and social sciences. The research aims to address fundamental challenges in partitioning large data sets into prescribed subsets, with potential impacts across fields such as...