Project Grant 2348740
Award Date
1/15/25
Completion Date
12/31/27
Dollars Obligated
$138K
Federal Agency
Division of Mathematical Sciences
Federal Grant Program
47.049
Assistance Type
Project Grant
Place of Performance
Lowell, MA 01854, USA
Similar Awards
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...
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 $210,000 Project Grant awarded by the National Science Foundation (NSF) under the Mathematical and Physical Sciences (CFDA 47.049) program supports research on combinatorial models in representation theory, geometry, and analysis. The principal investigator (PI) at Smith College will analyze two types of edge-labeled graphs - webs and algebraic splines - with applications in areas like knot theory, representation theory, combinatorics, and data compression/interpolation. The project will...
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...
The University of Massachusetts received a $180,000 project grant award from the National Science Foundation to support research in extremal graph theory and sums of squares from July 1, 2021 through June 30, 2024. The grant is funded through the NSF's Mathematical and Physical Sciences program (CFDA 47.049), which aims to strengthen the nation's scientific enterprise through increased understanding of major problems. Under this award, the University will conduct research and develop new...
This federal Project Grant award, funded by the National Science Foundation's (NSF) Mathematical and Physical Sciences Program (CFDA 47.049), supports research to develop a systematic mathematical approach for analyzing and visualizing large networks. The Principal Investigator (PI) aims to integrate discrete mathematics and analysis to extract large-scale features of complex networks, with potential applications in areas such as data analysis in sociology, psychology, and image processing....
The National Science Foundation (NSF) awarded a $270,000 Project Grant under the Mathematical and Physical Sciences Federal Grant Program (CFDA 47.049) to Carnegie Mellon University (CMU) to study various properties of random graphs/networks. The principal investigator will examine computational problems associated with these complex stochastic structures, such as optimizing routing algorithms. The research will involve graduate students and postdocs, and aims to address fundamental questions...
This $271,041 National Science Foundation (NSF) Computer and Information Science and Engineering (CFDA 47.070) project grant was awarded to Trustees of Boston University on October 1, 2025 for a 5-year period through September 30, 2030. The grant aims to develop improved approximation algorithms for NP-hard graph problems, with a focus on the Traveling Salesperson Problem, its asymmetric variant, and the K-Edge-Connected Spanning Subgraph problem. The research will investigate techniques such as...
This National Science Foundation project grant of $740,162 will fund collaborative research on extremal combinatorics and flag algebras from August 2022 through July 2025. The awardee is the University of Colorado Denver under the Mathematical and Physical Sciences program (CFDA 47.049). The research aims to resolve three prominent open questions in extremal combinatorics posed by Erdös, Turán, and Zarankiewicz using flag algebra techniques. The questions concern extremal hypergraph...
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...