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

2 041 (0,139s) •

Project

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

Flows in graphs have a long and rich history in combinatorial theory. In his by the duality to graph colorings in plane graphs. Nowhere-zero flows rose to prominence polynomial which enumerates flows<...

Pure mathematics

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

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

Flows in graphs and the dual notion of tensions permeate combinatorial theory, not least because their definition extends from graphs to other combinatorial structures such as matroids and embedded graphs, and due ...

Pure mathematics

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

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

and flows in graphs. The scope of the project also includes problems related to cycles in graphs and matroids and algorithmic applications of the studied objectsThe project belongs to the areas of structural and algorithmi...

BA - Obecná matematika

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

Graphs and their algebraic properties (GA19-21082S)

This project will develop the theory of graph colorings and flows in three related directions using algebraic techniques. Homological properties of graphs (cycle-continuous maps) have given fresh insights into the longstand...

Pure mathematics

  • 2019 - 2021
    • •
  • 7 470 tis. Kč
    • •
  • 6 295 tis. Kč
    • •
  • GA ČR
Project

Graphs and mappings -- Algebraic properties of graphs (GA16-19910S)

Main two topics of the project are vector coloring and flows in graphs. The first of them exemplifies usage of semidefinite programming to approximate chromatic space of graphs--a linear-algebraic object that encodes many p...

IN - Informatika

  • 2016 - 2018
    • •
  • 3 222 tis. Kč
    • •
  • 2 604 tis. Kč
    • •
  • GA ČR
Project

Graph coloring and structure (GA14-19503S)

of a given graph, nowhere-zero flows and group connectivity, or questions concerningThe project is focused at the chromatic and structural properties of graphs understanding of problems related to graph coloring a...

BA - Obecná matematika

  • 2014 - 2018
    • •
  • 3 936 tis. Kč
    • •
  • 3 936 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 ...

BA - Obecná matematika

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

Flows and cycles in graphs using mappings between graphs (GPP201/10/P337)

For a directed graph G=(V,E) (with vertices V and directed edges E) nowhere zero Zn-flow is a mapping f:E -> Zn{0} that satisfiesKichhoff's law at every vertex. Tutte discovered in 1950's that this is adual concept to that of a <...

BA - Obecná matematika

  • 2010 - 2012
    • •
  • 750 tis. Kč
    • •
  • 750 tis. Kč
    • •
  • GA ČR
Project

Optimizing Large-Scale Data-flows (7AMB12AT013)

Both partners institutions will cooperate on design and development of tools to support modelling and optimizing data-flows for data minimg and integration processes. In other words, the overall output of the project will be an otimization f...

IN - Informatika

  • 2012 - 2013
    • •
  • 138 tis. Kč
    • •
  • 138 tis. Kč
    • •
  • MŠMT
Project

Algebraic and number-theoretic aspects of graph theory (8J18FR004)

to the typical behaviour of random graph polynomials. The project can be divided into two parts: 1. Graph polynomials and flows for embedded graphs and their physical interpretation. 2. Sieve methods as a bridge ...

Pure mathematics

  • 2018 - 2019
    • •
  • 102 tis. Kč
    • •
  • 102 tis. Kč
    • •
  • MŠMT
  • 1 - 10 out of 2 041