Summary
This project concerns research on the frontier between discrete mathematics and computer science, and focuses on studying properties of randomly behaving discrete structures. Specifically, it studies quasi-random properties of k-uniform hypergraphs by using a combination of hypergraph regularity methods and flag algebras. The properties the project will be mainly focused on are containments and counting small substructures in large quasi-random hypergraphs. These questions are closely related to problems from other areas such as number theory, algorithm design, and property testing.
Unfold all
/
Fold all
More information & hyperlinks
| Web resources: | https://cordis.europa.eu/project/id/800607 |
| Start date: | 01-10-2018 |
| End date: | 18-04-2022 |
| Total budget - Public funding: | 239 860,80 Euro - 239 860,00 Euro |
Cordis data
Original description
This project concerns research on the frontier between discrete mathematics and computer science, and focuses on studying properties of randomly behaving discrete structures. Specifically, it studies quasi-random properties of k-uniform hypergraphs by using a combination of hypergraph regularity methods and flag algebras. The properties the project will be mainly focused on are containments and counting small substructures in large quasi-random hypergraphs. These questions are closely related to problems from other areas such as number theory, algorithm design, and property testing.Status
TERMINATEDCall topic
MSCA-IF-2017Update Date
28-04-2024
Images
No images available.
Geographical location(s)
Search
