课题基金 / 基金详情

LEAPS MPS: The Erdos-Ko-Rado Property of Well-Covered Graphs

LEAPS MPS: The Erdos-Ko-Rado Property of Well-Covered Graphs
LEAPS MPS:良好覆盖图的 Erdos-Ko-Rado 性质
批准号:
2213394
负责人:
Jessica De Silva
金额:
$24.93万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2022
资助国家:
美国
项目状态:
已结题
起止时间:
2022-08-01 至 2024-07-31
关键词:

项目摘要

项目成果

Jessica De Silva的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
Many types of relations and processes, including physical and social systems, can be modeled using a graph. Graph models of such systems tend to be very large, requiring mathematical techniques that can extract global information from the graph at the smaller, local level. Extremal graph theory can be thought of as the study of how global properties of a graph influence its local structure. The aim of this project is to investigate questions in extremal graph theory, particularly those that relate to a well-known extremal set theory result called the Erdos-Ko-Rado theorem. Undergraduate student researchers at the PI’s Hispanic-serving institution will work in pairs to take on parts of this project. These students will have the opportunity to learn how to leverage their individual strengths while conducting cutting-edge research. Additionally, a colloquium series will be established within this project to connect students and faculty in the PI’s department to high-impact role models in the mathematical sciences.The Erdos-Ko-Rado (EKR) theorem is a pivotal result in extremal set theory that gives an upper bound on the number of sets of a fixed size that are pairwise intersecting. Of particular interest is the straightforward construction of an intersecting family that attains this bound by collecting all sets of the specified size that contain some fixed element. In 2005, Holroyd, Spencer, and Talbot formulated an EKR property for graphs related to intersecting families of independent sets. This property has a corresponding construction, called an r-star, that takes all independent sets of size r containing a fixed vertex of the graph. A graph is called r-EKR if the maximum size of an intersecting family of size r independent sets is equal to the size of the largest r-star in the graph. This project aims to study the r-EKR property, and related concepts, for certain classes of graphs.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Collaborative Planning Grant: Building Capacity to Scale the Mentoring Math Scholars for Success Program
Catalyzing New Practices for the San Joaquin Valley to Innovate Effective Teaching Pedagogies in Lower-Division Mathematics and Chemistry Courses
国内基金
海外基金
时序释放Met/Qct-MPs葡萄糖响应型水凝胶对糖尿病创面微环境调节机制的研究
  • 批准号:
  • 项目类别:
    省市级项目
  • 资助金额:
    --
  • 批准年份:
    2025
  • 负责人:
    郭菁菁
  • 依托单位:
脓毒症血浆中微粒(MPs)对免疫细胞的作用机制 及其免疫抑制的机制研究
  • 批准号:
  • 项目类别:
    省市级项目
  • 资助金额:
    --
  • 批准年份:
    2025
  • 负责人:
    潘柳华
  • 依托单位:
中性粒细胞释放CitH3+MPs活化NLRP3炎性小体激活胆汁淤积性肝病肝内凝血活性
  • 批准号:
  • 项目类别:
    省市级项目
  • 资助金额:
    --
  • 批准年份:
    2025
  • 负责人:
    张津铭
  • 依托单位:
人工湿地中典型MPs与SMX互作对氮转化过程影响机制研究
  • 批准号:
  • 项目类别:
    省市级项目
  • 资助金额:
    --
  • 批准年份:
    2025
  • 负责人:
  • 依托单位: