Turan-type problems for graphs and hypergraphs

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.

Fields of science

• natural sciences › mathematics › pure mathematics › discrete mathematics › graph theory

Programme(s)

• H2020-EU.1.3. - EXCELLENT SCIENCE - Marie Skłodowska-Curie Actions Main Programme
• H2020-EU.1.3.2. - Nurturing excellence by means of cross-border and cross-sector mobility

Topic(s)

• MSCA-IF-2018 - Individual Fellowships

Call for proposal

H2020-MSCA-IF-2018

See other projects for this call

Funding Scheme

MSCA-IF-GF - Global Fellowships

Coordinator

LONDON SCHOOL OF ECONOMICS AND POLITICAL SCIENCE

Net EU contribution

€ 189 099,84

Address

Houghton Street 1
WC2A 2AE London
United Kingdom

Region

London › Inner London — West › Westminster

Activity type

Higher or Secondary Education Establishments

Links

Other funding

€ 0,00

Partners (1)

Partner

Partner organisations contribute to the implementation of the action, but do not sign the Grant Agreement.

The University of Illinois at Chicago

United States

Net EU contribution

€ 0,00

Address

1747 W. Roosevelt Rd., Wrob/ijr Rm.
244, Chicago, Il 60608,

Activity type

Private for-profit entities (excluding Higher or Secondary Education Establishments)

Links

Other funding

€ 82 632,96