All
All

What are you looking for?

All
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

-
19852030

Join usingOrAnd

Join usingOrAnd

SelectAll/None

      • Show more

      • Show more

      • Show more

      • Show more

      • Show more

    • Show more

SelectAll/None

Join usingOrAnd

-

More filters

Projects

1 977 projects (0,191s) •

Project

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

Highly symmetric graphs appear naturally in many different problems in computer, partitions or trees - is another source of a multitude of highly symmetric graphs. In this project, we will investi...

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

Principles of combinatorial generation (GA22-15272S)

Generation of combinatorial objects is a fundamental algorithmic task with a wide range of practical applications. This task leads to the definition of flip graphs, which have as vertices the objects to be generated, and edges connect object...

Applied mathematics

  • 2022 - 2024
    • •
  • 6 795 tis. Kč
    • •
  • 6 552 tis. Kč
    • •
  • GA ČR
Project

Paradoxical flexibility of frameworks (GF22-04381L)

A framework which is a graph together with a realization of its vertices is flexible. Since rigidity is a generic property, the graph itself can be called rigid if every generic realization yields a rigid framework. Nevertheless, su...

Applied mathematics

  • 2022 - 2025
    • •
  • 2 442 tis. Kč
    • •
  • 2 442 tis. Kč
    • •
  • GA ČR
Project

Highly structured distributions in artificial intelligence, cryptography and combinatorics (IAA1075104)

Modern applications of calculi for dealing with uncertainty and of multivariate statistics rely on highly structured distributions. The knowledge how to construct knowledge in form of graphs, conditional independence constraints and...

BA - Obecná matematika

  • 2001 - 2005
    • •
  • 3 620 tis. Kč
    • •
  • 1 340 tis. Kč
    • •
  • AV ČR
Project

X-ray multilayer mirrors replication technology. (FT-TA3/112)

The goal of the project is to design a technology of preparation of supersmooth aspheric X-ray reflecting structures for manufacturing rotationally symmetric X-ray-raymirrors will allow applications in highly demanding instruments. ...

BH - Optika, masery a lasery

  • 2006 - 2009
    • •
  • 11 705 tis. Kč
    • •
  • 7 404 tis. Kč
    • •
  • MPO
Project

Structure of standard invariant operators for parabolic geometries (GA201/00/P068)

sequences for manifolds with almost Hermitian symmetric structure. The project aims the weightgraph; to find connections of weight graphs and Hasse diagrams for different types......

BA - Obecná matematika

  • 2000 - 2002
    • •
  • 747 tis. Kč
    • •
  • 747 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 1 977