Strukturni in algoritmični vidiki grafovskih razredov, definiranih preko klik in neodvisnih množic / Structural and Algorithmic Aspects of Graph Classes Defined by Cliques and Stable Sets

Naziv Tittle	Strukturni in algoritmični vidiki grafovskih razredov, definiranih preko klik in neodvisnih množic / Structural and Algorithmic Aspects of Graph Classes Defined by Cliques and Stable Sets
Akronim Acronim	BI-FR/15-16-PROTEUS-003
Opis Description	(SI) Glavni cilj predlaganega projekta bo tako raziskati odnose med grafovskimi razredi, definiranimi s pomočjo klik in neodvisnih množic, s posebnim poudarkom na pridobitev novih rezultatov, povezanih z domnevama Orlina in Mahadeva, Peleda in Suna. Pričakujemo, da bodo raziskovalci na obeh sodelujočih straneh prispevali k različnim delom projekta skladno s svojimi specifičnimi strokovnimi znanji. (EN) The main objective of the proposed project will be to investigate the relationships between graph classes defined by cliques and independent sets, with a particular focus on obtaining new results related to the Orlin and Mahadev, Peled and Sun hypotheses. We expect researchers on both sides to contribute to different parts of the project according to their specific expertise.
Trajanje Duration	01/01/2015 - 31/12/2015
Vodja projekta Project Leader	dr. Martin Milanič
Sodelujoče organizacije Participating organizations	Universite Paris Dauphine LAMSADE
Oddelek Department	Oddelek za matematiko IAM