All
All

What are you looking for?

All
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

-
19852030

Join usingOrAnd

Join usingOrAnd

SelectAll/None

      • Show more

      • Show more

      • Show more

    • Show more

SelectAll/None

Join usingOrAnd

-

More filters

Projects

224 projects (0,222s) •

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

Pure mathematics

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

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

notions: graphs, polynomials, groups, sieve methods and discrete probabilities to the typical behaviour of random graph polynomials. The project can be divided into two parts: 1. Graph polynomials

Pure mathematics

  • 2018 - 2019
    • •
  • 102 tis. Kč
    • •
  • 102 tis. Kč
    • •
  • MŠMT
Project

Algebraic approaches to combinatorial problems perfect matchings, permanents and hyperbolic polynomials (MEB021115)

The goal of this project is the study of selected combinatorial problems from an algebraic perspective. We will concentrate on the relation between matrix permanents and perfect matchings in graphs, and the use of mixed discriminants in comb...

BA - Obecná matematika

  • 2011 - 2012
    • •
  • 128 tis. Kč
    • •
  • 128 tis. Kč
    • •
  • MŠMT
Project

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

polynomial which enumerates flows and relates them to other graph invariants whenFlows in graphs have a long and rich history in combinatorial theory. In his by the duality to graph colorings in plane graphs<...

Pure mathematics

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

Enumeration in informatics and optimization (GA13-21988S)

understanding complexity of graph isomorphism by studying the conjecture that non-isomorphic chordal graphs are detected by the partition function of the Potts model in variable magnetic field; this function is equivalent to a deco...

IN - Informatika

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

Graphs and their algebraic properties (GA19-21082S)

"topological Tutte polynomial" for embedded graphs was constructed in the spirit of Tutte'sThis project will develop the theory of graph colorings and flows in three related directions using algebraic techniques. Homologic...

Pure mathematics

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

Algorithms and Complexity within and beyond Bounded Expansion (LL2005)

The project is in the area of the structural graph theory, with focus on the applications in the design of approximation and parameterized algorithms and on obtaining expansion at the phase transition points where the behavior of the gra...

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

  • 2020 - 2022
    • •
  • 7 167 tis. Kč
    • •
  • 7 167 tis. Kč
    • •
  • MŠMT
Project

Colourings, cycles and closures (MEB101014)

of Graph Theory. The first problem asks for the computation of a minimum rainbow subgraph (MRS) of a given graph G; The second problem asks for the computation of a longest cyclein a given (finite) graph. Both problems are...

BA - Obecná matematika

  • 2010 - 2011
    • •
  • 90 tis. Kč
    • •
  • 90 tis. Kč
    • •
  • MŠMT
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
  • 1 - 10 out of 224