Vše

Co hledáte?

Vše
Projekty
Výsledky výzkumu
Subjekty

Rychlé hledání

  • Projekty podpořené TA ČR
  • Významné projekty
  • Projekty s nejvyšší státní podporou
  • Aktuálně běžící projekty

Chytré vyhledávání

  • Takto najdu konkrétní +slovo
  • Takto z výsledků -slovo zcela vynechám
  • “Takto můžu najít celou frázi”
CS
ČeštinaEnglish

Filtry

257 (0,063s) •

Projekt

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 ...

BA - Obecná matematika

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

Enumeration in informatics and optimization (GA13-21988S)

partition function, to determinantal complexity. Secondly, we want to advance understanding complexity of graph isomorphism by studying the conjecture that non-isomorphic chordal graphs are detected by the partition

IN - Informatika

  • 2013 - 2019
    • •
  • 2 577 tis. Kč
    • •
  • 2 577 tis. Kč
    • •
  • GA ČR
Projekt

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

, partitions or trees - is another source of a multitude of highly symmetric graphs. In this project, we will investigate fundamental graph structures such as Hamilton cycles, matchings, and colorings in several families of...

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
Projekt

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

of such a subobject is to show that the object can be partitioned into a small number of well with given properties. This gives a natural connection between graph coloring and Ramsey theory. The connection goes both ways - many r...

BA - Obecná matematika

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

Fundamental questions of discrete geometry (GX23-04949X)

The project is focused on selected fundamental questions of discrete and computational geometry. These fundamental questions include questions around the Erdős-Szekeres Happy Ending theorem, on crossing numbers of graphs, on visibility for p...

Pure mathematics

  • 2023 - 2027
    • •
  • 47 866 tis. Kč
    • •
  • 47 866 tis. Kč
    • •
  • GA ČR
Projekt

Development of intelligent interior partitions (EG16_084/0009217)

Development of intelligent interior partitions...

AL - Umění, architektura, kulturní dědictví

  • 2017 - 2020
    • •
  • 43 743 tis. Kč
    • •
  • 28 293 tis. Kč
    • •
  • MPO
Projekt

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
Projekt

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
Projekt

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
Projekt

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
  • 1 - 10 z 257