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

2 748 (0,125s) •

Project

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

, for example, structural graph theory, advanced geometric Ramsey theory, obstruction theory as with focus on graph classes defined by a topological condition. (iv) Further topics, combinatorial ...

Pure mathematics

  • 2019 - 2022
    • •
  • 6 450 tis. Kč
    • •
  • 6 450 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 among the simples...

Pure mathematics

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

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

of topological and geometric methods in graph theory. Within the first line of research, we, the topological obstructions characterizing certain minor-closed graph classes of topological grap...

BA - Obecná matematika

  • 2016 - 2018
    • •
  • 4 949 tis. Kč
    • •
  • 4 949 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 is to find new application areas of structural graph

IN - Informatika

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

Structure of tractable instances of hard algorithmic problems on graphs (GA20-04567S)

the internal structure of tractable instances of such generally hard problems on graphs, namely those dealing with structural and topological graph theory, geometric graphs of graph classes, prop...

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

  • 2020 - 2022
    • •
  • 8 174 tis. Kč
    • •
  • 6 521 tis. Kč
    • •
  • GA ČR
Project

Structural properties, parameterized tractability and hardness in combinatorial problems (GA17-00837S)

and topological graph theory, and to logic and interpretations in graphs. Among the problems graph classes, FO interpretations in sparse classes and their structural characterizations, parameterized tract...

IN - Informatika

  • 2017 - 2019
    • •
  • 4 758 tis. Kč
    • •
  • 3 294 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

Structure of planar graphs and applications to graph colorings and frequency assignment (MEB090805)

of planar graphs, in particular, establishing the existence of various types of subgraphs, 2. graph theory models for the channel assignment problem, in particular is investigation of structure of planar graphs wi...

BA - Obecná matematika

  • 2008 - 2009
    • •
  • 160 tis. Kč
    • •
  • 160 tis. Kč
    • •
  • MŠMT
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 inf...

Pure mathematics

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

Algorithmic, structural and complexity aspects of geometric configurations (GA21-32817S)

Configurations of points, lines, convex sets and other simple geometric objects in the plane and graphs visualized in the plane belong to the basic structures of computer and complexity questions on basic combinatorial and convex properties ...

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

  • 2021 - 2024
    • •
  • 4 397 tis. Kč
    • •
  • 3 920 tis. Kč
    • •
  • GA ČR
  • 1 - 10 out of 2 748