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”
EN
ČeštinaEnglish

Filters

221 (0,13s) •

Project

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

Many important graph properties can be characterized in terms of forbidden induced subgraphs, or become more tractable when considered in such graph classes. The problems considered in such classes under this project belong to H...

Pure mathematics

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

Colourings and connection in graphs (7AMB16DE001)

to the channel assignment problem in mobile networks; - hamiltonian properties of graphs – knowledge about the Hamilton-type properties of a graph has major importance and interrelated problems in the field of graph

BA - Obecná matematika

  • 2016 - 2017
    • •
  • 143 tis. Kč
    • •
  • 143 tis. Kč
    • •
  • MŠMT
Project

Graph coloring and structure (GA14-19503S)

The project is focused at the chromatic and structural properties of graphs understanding of problems related to graph coloring and structure. Particular topics within the scope of the project include the fractional coloring of ...

BA - Obecná matematika

  • 2014 - 2018
    • •
  • 3 936 tis. Kč
    • •
  • 3 936 tis. Kč
    • •
  • GA ČR
Project

Global properties of locally characterized classes of graphs (GA201/97/0407)

properties of graphs. In this field of research, conclusion on algorithmically difficult on furtherdevelopment of the new concept of the local closure of a claw-free graph ( introduced hamiltonian properties, toughness, in...

BA - Obecná matematika

  • 1997 - 1999
    • •
  • 731 tis. Kč
    • •
  • 351 tis. Kč
    • •
  • GA ČR
Project

Graph limits and beyond (GX21-21762X)

The theory of graph limits is one of the most important recently emerged tools of discrete mathematics. It has led to breakthrough solutions of many old problems in extremal graph theory, theory of random graphs and in part...

Pure mathematics

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

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

Theories of dense and sparse graph limits are one of the most important recent breakthroughs on old problems in extremal graph theory and random graph theory graph limits as well as the related theory of inhomogene...

Pure mathematics

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

Graph Partitions and their Applications (MEB091037)

Many of the notions in graph theory, in particular, colorings, flows and matchings turn out to be partitions of a graph with particular properties of the methods originally developed for graph colorings are useful in the st...

BA - Obecná matematika

  • 2010 - 2011
    • •
  • 112 tis. Kč
    • •
  • 112 tis. Kč
    • •
  • MŠMT
Project

Extremal graph theory and applications (GJ16-07822Y)

Graphs are among the simplest mathematical structures. They form the foundation with the development of computer networks. Extremal graph theory focuses on interactions between different properties of graphs. In this projec...

BA - Obecná matematika

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

Revealing structure of graphs and groups through polynomials (7AMB14FR068)

Study of graph isomorphism by means of graph polynomials. Study of reduction patterns of integral polynomials. Study of group large sieve. Study of 3-dimensional determinants.......

BA - Obecná matematika

  • 2014 - 2015
    • •
  • 108 tis. Kč
    • •
  • 108 tis. Kč
    • •
  • MŠMT
Project

Structural properties of graphs with no long paths (8J19FR027)

Hereditary graph classes, that is, classes closed under vertex deletion, are an important type graph classes which is intensively studied. In the project, we intend to study structural and algorithmic and structural aspects of hered...

Pure mathematics

  • 2019 - 2021
    • •
  • 96 tis. Kč
    • •
  • 96 tis. Kč
    • •
  • MŠMT
  • 1 - 10 out of 221