Grafi s primitivno grupo avtomorfizmov / Graphs with primitive automorphism group
|
Naziv Tittle |
Grafi s primitivno grupo avtomorfizmov / Graphs with primitive automorphism group |
|
Akronim Acronim |
BI-RU/19-20-033 |
|
Opis Description |
(SI) Vokviru predlaganega bilateralnega projekta bomo obravnavali obstoj hamiltonskih ciklov v točkovno-tranzitivnih grafih s primitivno grupo avtomorfizmov, poseben primer dobro poznane odprte Lovaszove domneve o obstoju hamiltonskih ciklov oziroma poti v povezanih točkovno tranzitivnih grafih. (Osnovne definicije: Točkovno tranzitiven graf je graf, katerega grupa avtomorfizmov deluje tranzitivno na množici točk. Permuatcijska grupa je primitivna v kolikor ne premore netrivialnih invariantnih particij. Hamiltonski cikel (pot) je cikel (pot) v grafu, ki vsebuje vse točke grafa.) (EN) Within the framework of the proposed bilateral project, we will study the existence of Hamiltonian cycles in vertex-transitive graphs with a primitive group of automorphisms. This is a special case of the well-known open Lovasz's conjecture about the existence of Hamiltonian cycles and paths in connected vertex-transitive graphs. (Basic definitions: A vertex-transitive graph is a graph whose automorphism group acts transitively on the vertices of the graph). A permutation group is primitive if it does not admit any non-trivial invariant partition. A Hamiltonian cycle (path) is a cycle (path) in a graph that contains all the vertices of the graph. |
|
Trajanje Duration |
01/01/2019 - 31/12/2021 |
|
Vodja projekta Project Leader |
Klavdija Kutnar |
|
Sodelujoče organizacije Participating organizations |
Federal Research Centre "Computer Science and Control", Institute for System Analysis Russian Academy of Science |
|
Oddelek Department |
Oddelek za matematiko IAM |