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

454 (0,126s) •

Project

Topological and geometric approaches to classes of permutations and graph properties (GJ16-01602Y)

, the topological obstructions characterizing certain minor-closed graph classes to combinatorial and graph-theoretic problems. We plan to pursue two main lines of research of topological and geometric methods in graph<...

BA - Obecná matematika

  • 2016 - 2018
    • •
  • 4 949 tis. Kč
    • •
  • 4 949 tis. Kč
    • •
  • GA ČR
Project

Advanced tools in combinatorics, topology and related areas (GJ19-04113Y)

, for example, structural graph theory, advanced geometric Ramsey theory, obstruction theory, homology minors, properties of singular 3-manifolds. More concretely, we plan of embeddings (of graphs, simplicial complexes) ...

Pure mathematics

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

Structural properties and algorithmic complexity of discrete problems (GA201/05/0050)

and revolutionary Graph Minor Theory of Robertson and Seymour. Moreover, there is the new theoryMany practical algorithmic problems have a core based on the structures of discrete mathematics, like on graphs or matroids. I...

BA - Obecná matematika

  • 2005 - 2007
    • •
  • 472 tis. Kč
    • •
  • 453 tis. Kč
    • •
  • GA ČR
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

Structural graph theory and parameterized complexity (GC201/09/J021)

graph theory has already proved very useful in parameterized algorithmics. For instance, most of traditional hard problems are efficiently solvable on graphs of bounded tree-width. We plan to exploit other structural properties of ...

IN - Informatika

  • 2009 - 2010
    • •
  • 1 014 tis. Kč
    • •
  • 1 014 tis. Kč
    • •
  • GA ČR
Project

Utilization of structural and "Width" parameters in combinatorics and algorithmic complexity (GA201/08/0308)

Many practical algorithmic problems have a core based on combinatorial structures, such as graphs, digraphs, or matroids. Although it is typically infeasible to give general algorithmic solutions of (majority of) these problems, it is often ...

BA - Obecná matematika

  • 2008 - 2010
    • •
  • 946 tis. Kč
    • •
  • 946 tis. Kč
    • •
  • GA ČR
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 and to chromatic graph theory. In Hamiltonian graph theor...

Pure mathematics

  • 2020 - 2023
    • •
  • 7 905 tis. Kč
    • •
  • 7 644 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
  • 1 - 10 out of 454