Project description
Turan-type problems under study
A central question in graph theory is determining how many edges a graph has if it does not contain a specified configuration as a subgraph. Mantel’s theorem from 1908 gives the maximum number of edges a graph can have on a given number of vertices if it does not contain a triangle. Extremal problems of this type are known as Turan-type problems. Funded by the Marie Skłodowska-Curie Actions programme, the TurantypeProblems project will study several Turan-type problems concerning graphs and hypergraphs as well as related extremal problems on rainbow structures.
Programme(s)
Funding Scheme
MSCA-IF-GF - Global FellowshipsCoordinator
WC2A 2AE London
United Kingdom
See on map
Partners (1)
Partner organisations contribute to the implementation of the action, but do not sign the Grant Agreement.
244, Chicago, Il 60608,
See on map