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

539 (0,12s) •

Project

New combinatorial algorithms - decompositions, parameterization, efficient solutions (LH12095)

The project brings new mathematical results concerning optimizing combinatorial problems. As a necessary requirement for the development of efficient algorithms the project focuses on structural dependencies of the studied problems in terms of gr...

BA - Obecná matematika

  • 2012 - 2015
    • •
  • 1 967 tis. Kč
    • •
  • 1 767 tis. Kč
    • •
  • MŠMT
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 colorings are often best viewed as decompositions into matchings, and conver...

BA - Obecná matematika

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

Model theory, structural combinatorics, and algorithms (GM24-12591M)

Our research will study the emerging connections between model theory and structural graph theory. Model theory provides a collection of concepts and tools recovers key definitions from structural graph theory and provides new and u...

Pure mathematics

  • 2024 - 2028
    • •
  • 14 077 tis. Kč
    • •
  • 14 077 tis. Kč
    • •
  • GA ČR
Project

Theory of Real Functions and Descriptive Set Theory III (GAP201/12/0436)

and decomposition of analytic and Borel subsets of a product of complete spaces, and on related problems from the theory of analytic graphs. We will continue in the study of non......

BA - Obecná matematika

  • 2012 - 2014
    • •
  • 2 190 tis. Kč
    • •
  • 2 190 tis. Kč
    • •
  • GA ČR
Project

Combinatorial structures, continuous mathematics and their impact on the design of efficient algorithms (GA25-16847S)

in the following four areas: 1. Embeddability 2. Forbidden substructures in graphs and matroids 3. Combinatorial decompositions of topological spaces 4. Algorithmic problems......

Pure mathematics

  • 2025 - 2027
    • •
  • 9 753 tis. Kč
    • •
  • 9 327 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

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
  • 1 - 10 out of 539