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”

Filtry

3 577 (0,082s)

Projekt

Flows, cycles, surfaces and polynomials (GA25-16627S)

to the surfaces in which it embeds (the faces of a plane embedding of a bridgeless graph cover of graphs in surfaces, inspired by the success of the theory of random graphsFlows in graphs and the...

Pure mathematics

  • 2025 - 2027
  • 12 500 tis. Kč
  • 11 420 tis. Kč
  • GA ČR
Projekt

Flows and cycles in graphs on surfaces (GA22-17398S)

investigate the topic of flows in graphs drawn on surfaces, motivated by applicationsFlows in graphs have a long and rich history in combinatorial theory. In his by the duality to graph colorings in plane gra...

Pure mathematics

  • 2022 - 2024
  • 10 780 tis. Kč
  • 9 743 tis. Kč
  • GA ČR
Projekt

Beyond the Four Color Theorem (LL2328)

Cutting-edge research project in the area of graph theory – graph coloring and algorithms....

Pure mathematics

  • 2023 - 2028
  • 24 471 tis. Kč
  • 24 471 tis. Kč
  • MŠMT
Projekt

Graph Covers Symmetries and Complexity (GA20-15576S)

project we shall restrict ourselves to investigation of one- and two-dimensional structures, namely, to graphs, surfaces, and their quotients, that is to orbifolds of dimension 1 and 2. Coverings between graphs a...

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

  • 2020 - 2023
  • 8 573 tis. Kč
  • 7 581 tis. Kč
  • GA ČR
Projekt

Graph colorings and flows structure and applications (GA201/09/0197)

), the structure of critical and list-critical graphs on surfaces, the Shortest Cycle CoverThe project belongs to the areas of structural and algorithmic graph theory and flows in graphs. The scope of the project a...

BA - Obecná matematika

  • 2009 - 2011
  • 3 064 tis. Kč
  • 3 064 tis. Kč
  • GA ČR
Projekt

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

, the topological obstructions characterizing certain minor-closed graph classes, such as the class of graphs embeddable on a given surface, and we will also focus on properties to combinatorial and graph-theoretic...

BA - Obecná matematika

  • 2016 - 2018
  • 4 949 tis. Kč
  • 4 949 tis. Kč
  • GA ČR
Projekt

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

, for example, structural graph theory, advanced geometric Ramsey theory, obstruction theory of embeddings (of graphs, simplicial complexes) (iii) Properties of graphs with forbidden as with focus on graph classes...

Pure mathematics

  • 2019 - 2022
  • 6 450 tis. Kč
  • 6 450 tis. Kč
  • GA ČR
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 an...

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

Pure mathematics

  • 2018 - 2021
  • 8 941 tis. Kč
  • 8 941 tis. Kč
  • GA ČR
  • 1 - 10 z 3 577