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

219 (0,118s) •

Project

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

Theories of dense and sparse graph limits are one of the most important recent of sparse graph limits our main goal is to extend our understanding of local-global breakthroughs on old problems in extremal graph...

Pure mathematics

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

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

graph classes, FO interpretations in sparse classes and their structural characterizations, parameterized tractability of graph crossing number and planar insertion problems, structural characterization of crossing-critica...

IN - Informatika

  • 2017 - 2019
    • •
  • 4 758 tis. Kč
    • •
  • 3 294 tis. Kč
    • •
  • GA ČR
Project

Extremal graph theory and applications (GJ16-07822Y)

techniques that were developed for embedding problems in sparse graphs and thoseGraphs are among the simplest mathematical structures. They form the foundation with the development of computer networks. Extremal graph<...

BA - Obecná matematika

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

Random discrete structures (GJ20-27757Y)

the upper tail probability for small subgraph counts in sparse random graphs and probability theory. We consider basic discrete structures: graphs, digraphs, trees substructures (e.g., copies of a given graph), we...

Pure mathematics

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

Ramsey-like aspects of graph coloring (GA17-04611S)

areas, for example, size of independent sets in sparse graph classes (in relation with given properties. This gives a natural connection between graph coloring and Ramsey theory. The connection goes both ways - many resu...

BA - Obecná matematika

  • 2017 - 2019
    • •
  • 4 923 tis. Kč
    • •
  • 3 737 tis. Kč
    • •
  • GA ČR
Project

Complex Structures Regularities in Combinatorics and Discrete Mathematics (LL1201)

Basic research project in the border area of combinatorics, discrete mathematics and theoretical computer science, Particularly in connection to the asymptotic analysis of large networks. The methods involve most classical mathematical areas with som...

BA - Obecná matematika

  • 2012 - 2017
    • •
  • 35 730 tis. Kč
    • •
  • 35 730 tis. Kč
    • •
  • MŠMT
Project

Well-structured combinatorial classes, width parameters, and design of efficient algorithms (GAP202/11/0196)

structural results on classes of (sparse) combinatorial objects, particularly...

IN - Informatika

  • 2011 - 2013
    • •
  • 4 928 tis. Kč
    • •
  • 4 928 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

Parallel Input/Output Algorithms for Very Large Sparse Matrices (GAP202/12/2011)

Algorithms for solving so called "Grand challenge problems" lead to huge data sets, typically organized as sparse matrices. This project addresses operationson very large sparse matrices that due to their size must be stor...

IN - Informatika

  • 2012 - 2014
    • •
  • 2 933 tis. Kč
    • •
  • 2 933 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
  • 1 - 10 out of 219