All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

3 548 (0,183s)

Project

Extremal graph theory and applications (GJ16-07822Y)

with the development of computer networks. Extremal graph theory focuses on interactions between different properties of graphs. In this project we link extremal graph theory to several ...

BA - Obecná matematika

  • 2016 - 2020
  • 7 610 tis. Kč
  • 7 610 tis. Kč
  • GA ČR
Project

Graph limits and beyond (GX21-21762X)

in extremal graph theory, theory of random graphs and in particular in connecting discrete mathematics to fields such as probability, real anf functional analysis and group theory. In the projec...

Pure mathematics

  • 2021 - 2025
  • 13 626 tis. Kč
  • 13 626 tis. Kč
  • GA ČR
Project

Embedding, Packing and Limits in Graphs (GA19-08740S)

extremal graph theory, as well as the recent related area of limits of graphs. We shall exploit classical methods from extremal graph theory, as well as probabilisticGraphs are...

Pure mathematics

  • 2019 - 2022
  • 6 257 tis. Kč
  • 6 257 tis. Kč
  • GA ČR
Project

Graph limits and inhomogeneous random graphs (GJ18-01472Y)

breakthroughs on old problems in extremal graph theory and random graph theory, and especially have linked discrete mathematics to areas such as probability theoryTheories of dense and s...

Pure mathematics

  • 2018 - 2021
  • 8 941 tis. Kč
  • 8 941 tis. Kč
  • GA ČR
Project

Model thoery and extremal combinatorics (GJ18-13685Y)

Ramsey theory is fast evolving as an area which uses and enriches research not only in combinatorics, but also in model theory, topological dynamics, category theory, constraint satisfaction problem solving and infinitary c...

Pure mathematics

  • 2018 - 2021
  • 6 197 tis. Kč
  • 6 197 tis. Kč
  • GA ČR
Project

Structures and algorithms in highly symmetric graphs (GA19-08554S)

Highly symmetric graphs appear naturally in many different problems in computer science and discrete mathematics, for instance in coding theory, extremal, partitions or trees - is another source of a multitude of highly sym...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2019 - 2022
  • 6 482 tis. Kč
  • 6 215 tis. Kč
  • GA ČR
Project

Structural properties of graph classes characterized by forbidden subgraphs (GA20-09525S)

and to chromatic graph theory. In Hamiltonian graph theory, we focus on Hamiltonian properties graph theory, we will consider especially chromatic properties of graphs fromMany important...

Pure mathematics

  • 2020 - 2023
  • 7 905 tis. Kč
  • 7 644 tis. Kč
  • GA ČR
Project

Flows, cycles, surfaces and polynomials (GA25-16627S)

Flows in graphs and the dual notion of tensions permeate combinatorial theory, not least because their definition extends from graphs to other combinatorial structures such as matroids and embedded graphs, and due ...

Pure mathematics

  • 2025 - 2027
  • 12 500 tis. Kč
  • 11 420 tis. Kč
  • GA ČR
Project

Graphs and their algebraic properties (GA19-21082S)

This project will develop the theory of graph colorings and flows in three related directions using algebraic techniques. Homological properties of graphs (cycle and other pivotal open problems in structural graph ...

Pure mathematics

  • 2019 - 2021
  • 7 470 tis. Kč
  • 6 295 tis. Kč
  • GA ČR
Project

Beyond the Four Color Theorem (LL2328)

Cutting-edge research project in the area of graph theorygraph coloring and algorithms....

Pure mathematics

  • 2023 - 2028
  • 24 471 tis. Kč
  • 24 471 tis. Kč
  • MŠMT
  • 1 - 10 out of 3 548